- IDEALS Home
- →
- College of Engineering
- →
- Dept. of Computer Science
- →
- Browse Dept. of Computer Science by Title
Browse Dept. of Computer Science by Title
Now showing items 2916-2935 of 2985
-
(1995)In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors is likely to achieve better performance. However, analytical and efficient validation methods for determining whether all the ...
application/pdf
PDF (5MB)
-
(Lawrence Livermore National Laboratory Technical Report, 2010-08-12)A means for translating MCNP5 input files into a form that can be run by Mercury, a modern Monte Carlo particle transport code, will allow MCNP5 users to more easily take advantage of the high-performance computing benefits ...
application/pdf
PDF (612kB)
-
(2007-10)Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E = \Delta \uplus B with B a set of axioms for which a finitary unification algorithm exists, and \Delta a set ...
application/pdf
PDF (309kB)
-
(2009-03)For narrowing with a set of rules \Delta modulo a set of axioms B almost nothing is known about terminating narrowing strategies, and basic narrowing is known to be incomplete for B=AC. In this work we ask and answer the ...
application/pdf
PDF (312kB)
-
(2009-03)For narrowing with a set of rules \Delta modulo a set of axioms B almost nothing is known about terminating narrowing strategies, and basic narrowing is known to be incomplete for B=AC. In this work we ask and answer the ...
application/pdf
PDF (312kB)
-
(2018-02-12)Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure ...
application/pdf
PDF (418kB)
-
(2017-06-27)Decision procedures can be either theory specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure ...
application/pdf
PDF (439kB)
-
(2015-11)Although different satisfiability decision procedures can be combined by algorithms such as those of Nelson-Oppen or Shostak, current tools typically can only support a finite number of theories to use in such ...
application/pdf
PDF (656kB)
-
(2014-02-11)Variants and the finite variant property were originally introduced about a decade ago by Hurbert Comon-Lundh and Stephanie Delaune to reason about equational theories that commonly appear in cryptographic protocol analysis. ...
application/pdf
PDF (340kB)
-
(2006-05)Both the measurement and simulation of unsteady flow yield huge datasets of time-varying volumetric vector fields. Flow dynamics researchers face the very difficult task of finding, extracting and analyzing important flow ...
application/pdf
PDF (31MB)
-
(2006)We propose an image editing system that decouples feature position from pixel color generation to achieve a morph that preserves texture detail and orientation near the dragged silhouette, synthesized using the original ...
application/pdf
PDF (6MB)
-
(2013-05-24)Cyber-physical systems (CPS) use networked control software to interact with and manipulate the physical world. Examples of cyber-physical systems include smart buildings, power distribution networks, and fleets of autonomous ...
application/pdf
PDF (4MB)
-
(2011-01-14)With the advent of multicores, parallel programming has gained a lot of importance. For parallel programming to be viable for the predicted hundreds of cores per chip, shared memory programming languages and environments ...
application/pdf
PDF (328kB)
-
(2018-11-19)This report describes our effort to model and verify the Casper blockchain finality system in the Coq proof assistant. We outline the salient details on blockchain systems using Casper, describe previous verification ...
application/pdf
PDF (424kB)
-
(2017-12-05)With computers becoming ubiquitous there is an ever growing necessity to ensure that they are programmed to behave correctly. Formal verification is a discipline within computer science that tackles issues related to design ...
application/pdf
PDF (2MB)
-
(2017-04-18)We consider the problem of verifying the security of finitely many sessions of a protocol that tosses coins in addition to standard cryptographic primitives against a Dolev-Yao adversary. Two properties are investigated ...
application/pdf
PDF (457kB)
-
(2008-08)Verifiation and Validation (V&V) is a critically important phase in the development life cycle of a simulation model. In the context of network simulation, traditional network simulators perform well in using a simulation ...
application/pdf
PDF (829kB)
-
(2008)Finally, we present incremental state space exploration (ISSE), a technique that aims to provide a speedup in the state space exploration time of evolving simulation models; i.e., simulation models whose code changes from ...
application/pdf
PDF (9MB)
-
(2008-08)Verifiation and Validation (V&V) is a critically important phase in the development life cycle of a simulation model. In the context of network simulation, traditional network simulators perform well in using a simulation ...
application/pdf
PDF (829kB)
-
(2007-08)Verification and Validation (V&V) is a critically important phase in the development life cycle of a simulation model. In the context of network simulation, traditional network simulators perform well in using a simulation ...
application/pdf
PDF (298kB)
Now showing items 2916-2935 of 2985