4257 search results - page 439 / 852 » The Logical Modularity of Programs |
207
click to vote
FDL
2006
IEEE
15 years 10 months ago
2006
IEEE
Many different system description and specification languages are used in modern design flows to emphasize different aspects like modular architecture, multibehavior, abstract act...
208
Voted
AISC
2010
Springer
15 years 10 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
177
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
183
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
193
click to vote
VSTTE
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a su...