1763 search results - page 140 / 353 » A Formalization of Polytime Functions |
119
click to vote
ICSE
2003
IEEE-ACM
15 years 3 months ago
2003
IEEE-ACM
Functional requirements contain, and systems exhibit, the behavior summarized below.Despite the advances in software engineering since 1968, how to go from a set of functional req...
CHI
2007
ACM
15 years 10 months ago
2007
ACM
Recent world-wide crisis events have drawn new attention to the role information communication technology (ICT) can play in warning and response activities. Drawing on disaster so...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...