1101 search results - page 159 / 221 » Forcing in proof theory |
127
click to vote
HYBRID
1998
Springer
15 years 4 months ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
114
Voted
IJCAI
2003
15 years 1 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
102
Voted
ENTCS
2008
15 years 19 days ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
114
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
222
Voted
POPL
2003
ACM
16 years 27 days ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...