2148 search results - page 101 / 430 » From process logic to program logic |
101
click to vote
FPGA
2003
ACM
15 years 3 months ago
2003
ACM
One of the most difficult and time-consuming steps in the creation of an FPGA is its transistor-level design and physical layout. Modern commercial FPGAs typically consume anywher...
106
click to vote
SPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
105
click to vote
WLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
KSEM
2010
Springer
14 years 7 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...