317 search results - page 42 / 64 » Reasoning about the Implementation of Concurrency Abstractio... |
139
click to vote
TACAS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
209
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
134
click to vote
DALT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Research on practical models of autonomous agents has largely focused on a procedural view of goal achievement. This allows for efficient implementations, but prevents an...
FM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Control diagrams are routinely used by engineers in the design of control systems. Yet, currently the formal verification of programs that implement the diagrams is a ch...
ILP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. It is well known by Inductive Logic Programming (ILP) practioners that ILP systems usually take a long time to find valuable models (theories). The problem is specially ...