16 search results - page 3 / 4 » Expressive Equivalence of Formalisms for Planning with Sensi... |
FMCAD
2004
Springer
14 years 5 days ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
PPDP
2007
Springer
14 years 27 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
ICFP
2003
ACM
14 years 6 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
DAGSTUHL
2007
13 years 8 months ago
2007
We explain the raison d’ˆetre and basic ideas of input/output logic, sketching the central elements with pointers to other publications for detailed developments. The motivation...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...