Sciweavers

5198 search results - page 744 / 1040
» A Logic of Agent Programs
Sort
View
169
Voted
ESOP
2010
Springer
16 years 4 months ago
Separating Shape Graphs
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
Vincent Laviron, Bor-Yuh Evan Chang and Xavier Riv...
FOSSACS
2007
Springer
16 years 27 days ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
16 years 27 days ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson
PADL
2007
Springer
16 years 26 days ago
Automatic Incrementalization of Prolog Based Static Analyses
Modern development environments integrate various static analyses into the build process. Analyses that analyze the whole project whenever the project changes are impractical in th...
Michael Eichberg, Matthias Kahl, Diptikalyan Saha,...
CCS
2005
ACM
16 years 8 days ago
The framework of selective interleaving functions and the modular assembly kit
The Framework of Selective Interleaving Functions and the Modular Assembly Kit for Security Properties both provide a basis for the uniform representation and formal analysis of n...
Heiko Mantel