Sciweavers

255 search results - page 10 / 51
» Proving BDI Properties of Agent-Oriented Programming Languag...
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 9 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
POPL
2008
ACM
16 years 1 days ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
77
Voted
POPL
2012
ACM
13 years 7 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
IFIP
1994
Springer
15 years 3 months ago
Factorizing Languages
We consider three notions of factorization arising in different frameworks: factorizing languages, factorization of the natural numbers, factorizing codes. A language X A is call...
Marcella Anselmo, Antonio Restivo
APLAS
2006
ACM
15 years 3 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt