Sciweavers

1291 search results - page 24 / 259
» Arithmetic program paths
Sort
View
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
14 years 3 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
DAC
2006
ACM
14 years 9 months ago
Efficient detection and exploitation of infeasible paths for software timing analysis
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...
Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, T...
POPL
2010
ACM
14 years 5 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
CAV
2008
Springer
170views Hardware» more  CAV 2008»
13 years 10 months ago
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
Himanshu Jain, Edmund M. Clarke, Orna Grumberg
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 8 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau