Sciweavers

455 search results - page 17 / 91
» The Linear Logical Abstract Machine
Sort
View
65
Voted
CORR
2004
Springer
85views Education» more  CORR 2004»
14 years 9 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
AMAST
2000
Springer
15 years 2 months ago
Step by Step to Histories
The behavior of reactive systems is typically speci ed by state machines. This results in an operational description of how a system its output. An alternative and more abstract ap...
Max Breitling, Jan Philipps
CADE
2006
Springer
15 years 10 months ago
Verifying Mixed Real-Integer Quantifier Elimination
Abstract. We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a wor...
Amine Chaieb
CADE
2008
Springer
15 years 10 months ago
Linear Quantifier Elimination
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
Tobias Nipkow
TCS
2012
13 years 5 months ago
Improved simulation of nondeterministic Turing machines
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
Subrahmanyam Kalyanasundaram, Richard J. Lipton, K...