96 search results - page 6 / 20 » Analyzing recursive programs using a fixed-point calculus |
104
click to vote
IJCAI
1997
14 years 11 months ago
1997
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
77
Voted
FASE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...
153
click to vote
RTA
2011
Springer
14 years 12 days ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
SAS
1997
Springer
15 years 1 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...