455 search results - page 56 / 91 » The Linear Logical Abstract Machine |
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
62
Voted
MLG
2007
Springer
15 years 3 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
COMPSAC
2009
IEEE
14 years 10 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
76
Voted
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...