Sciweavers

3239 search results - page 84 / 648
» A Logical Process Calculus
Sort
View
106
Voted
ICFP
2008
ACM
16 years 18 days ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
84
Voted
LICS
2006
IEEE
15 years 6 months ago
Saturated Semantics for Reactive Systems
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
Filippo Bonchi, Barbara König, Ugo Montanari
98
Voted
ESOP
2001
Springer
15 years 5 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
102
Voted
FSEN
2009
Springer
15 years 7 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
96
Voted
CLIMA
2004
15 years 2 months ago
Metareasoning for Multi-agent Epistemic Logics
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
Konstantine Arkoudas, Selmer Bringsjord