Sciweavers

3693 search results - page 506 / 739
» Splitting a Logic Program
Sort
View
96
Voted
FOSSACS
2007
Springer
15 years 8 months 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
118
Voted
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
15 years 8 months 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
118
Voted
PADL
2007
Springer
15 years 8 months 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,...
98
Voted
CCS
2005
ACM
15 years 8 months 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
113
Voted
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
15 years 8 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol