2607 search results - page 35 / 522 » Complete Functional Synthesis |
115
click to vote
CC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...
128
Voted
MCSS
2006
Springer
15 years 2 months ago
2006
Springer
In this paper we consider systems which are globally completly observable and output-to-state stable. The former property guarantees the existence of coordinates such that the dyna...
133
click to vote
DATE
2004
IEEE
15 years 6 months ago
2004
IEEE
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
92
Voted
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
151
Voted
ICFP
2012
ACM
13 years 5 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...