Sciweavers

267 search results - page 33 / 54
» Well Founded Semantics for Logic Program Updates
Sort
View
SCP
1998
138views more  SCP 1998»
13 years 8 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 8 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
POPL
2006
ACM
14 years 9 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
POPL
2011
ACM
12 years 11 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
EWSPT
2003
Springer
14 years 1 months ago
Formalizing Rework in Software Processes
Abstract. This paper indicates how effective software-process programming languages can lead to improved understandings of critical software processes, as well as improved process ...
Aaron G. Cass, Stanley M. Sutton Jr., Leon J. Oste...