1631 search results - page 202 / 327 » Observing Functional Logic Computations |
119
click to vote
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
114
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters, and can easily be produced inadvertently ...
145
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
128
Voted
JFP
2008
15 years 3 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
126
Voted
TCIAIG
2010
14 years 10 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...