Sciweavers

4257 search results - page 298 / 852
» The Logical Modularity of Programs
Sort
View
CADE
2010
Springer
15 years 7 months ago
iProver-Eq: An Instantiation-Based Theorem Prover with Equality
iProver-Eq is an implementation of an instantiation-based calculus Inst-Gen-Eq which is complete for first-order logic with equality. iProver-Eq extends the iProver system with sup...
Konstantin Korovin, Christoph Sticksel
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 10 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
POPL
2002
ACM
16 years 7 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ICFP
2009
ACM
16 years 7 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
WCRE
2007
IEEE
16 years 26 days ago
A Model to Understand the Building and Running Inter-Dependencies of Software
The notion of functional or modular dependency is fundamental to understand the architecture and inner workings of any software system. In this paper, we propose to extend that no...
Daniel M. Germán, Jesús M. Gonz&aacu...