Sciweavers

303 search results - page 19 / 61
» A formal executable semantics of Verilog
Sort
View
AUSAI
2007
Springer
13 years 11 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
ENTCS
2006
135views more  ENTCS 2006»
13 years 7 months ago
Coordination Models Based on a Formal Model of Distributed Object Reflection
We propose a family of models of coordination of distributed object systems representing different views, with refinement relations between the different views. We start with dist...
Carolyn L. Talcott
DNA
2009
Springer
158views Bioinformatics» more  DNA 2009»
14 years 2 months ago
Design of a Biomolecular Device That Executes Process Algebra
Process algebras are widely used for defining the formal semantics of concurrent communicating processes. In process algebra, concurrent processes can be specified to execute di...
Urmi Majumder, John H. Reif
EMSOFT
2007
Springer
14 years 1 months ago
WCET estimation for executables in the presence of data caches
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
Rathijit Sen, Y. N. Srikant
AOSD
2010
ACM
14 years 2 months ago
Execution levels for aspect-oriented programming
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if p...
Éric Tanter