756 search results - page 140 / 152 » Can Abstract State Machines Be Useful in Language Theory |
177
click to vote
ICTAC
2010
Springer
15 years 4 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
190
click to vote
CONCUR
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualit...
152
click to vote
VMCAI
2009
Springer
16 years 25 days ago
2009
Springer
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
151
click to vote
CCIA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
153
click to vote
ECAIW
1994
Springer
15 years 9 months ago
1994
Springer
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...