6274 search results - page 38 / 1255 » Proofs, Programs, Processes |
188
Voted
ICSE
2004
IEEE-ACM
16 years 6 months ago
2004
IEEE-ACM
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
134
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
171
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
213
click to vote
SAS
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. Shivers’s escape technique enables one to analyse the control flow of higher-order program fragments. It is widely used, but its soundness has never been proven. In th...
192
click to vote
TPHOL
2008
IEEE
16 years 24 days ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...