Sciweavers

632 search results - page 24 / 127
» Proving Invariants of Functional Programs
Sort
View
BIRTHDAY
2003
Springer
15 years 5 months ago
Extreme Model Checking
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
108
Voted
SAS
2007
Springer
15 years 6 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
ICFP
2012
ACM
13 years 2 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
106
Voted
IJFCS
2007
98views more  IJFCS 2007»
15 years 13 days ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
117
Voted
ENTCS
2007
101views more  ENTCS 2007»
15 years 14 days ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...