Sciweavers

1023 search results - page 129 / 205
» A Formal Method for Program Slicing
Sort
View
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
15 years 7 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
FORMATS
2005
Springer
15 years 7 months ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis
APLAS
2007
ACM
15 years 5 months ago
Translation Correctness for First-Order Object-Oriented Pattern Matching
Pattern matching makes ML programs more concise and readable, and these qualities are also sought in object-oriented settings. However, objects and classes come with open erarchie...
Burak Emir, Qin Ma 0002, Martin Odersky
DSN
2004
IEEE
15 years 5 months ago
Does Your Result Checker Really Check?
A result checker is a program that checks the output of the computation of the observed program for correctness. Introduced originally by Blum, the result checking paradigm has pr...
Lan Guo, Supratik Mukhopadhyay, Bojan Cukic
132
Voted
APLAS
2011
ACM
14 years 1 months ago
Soundness of Data Flow Analyses for Weak Memory Models
Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and ...
Jade Alglave, Daniel Kroening, John Lugton, Vincen...