History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 | next | last

Result 1 to 19 of 19 total

Charge! A framework for higher-order separation logic in Coq. (English)
Beringer, Lennart (ed.) et al., Interactive theorem proving. Third international conference, ITP 2012, Princeton, NJ, USA, August 13‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32346-1/pbk). Lecture Notes in Computer Science 7406, 315-331 (2012).
1
Verifying object-oriented programs with higher-order separation logic in Coq. (English)
van Eekelen, Marko (ed.) et al., Interactive theorem proving. Second international conference, ITP 2011, Berg en Dal, The Netherlands, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22862-9/pbk). Lecture Notes in Computer Science 6898, 22-38 (2011).
2
Psi-calculi: a framework for mobile processes with nominal data and logic. (English)
Log. Methods Comput. Sci. 7, No. 1, Paper No. 11, 44 p., electronic only (2011).
3
Psi-calculi: a framework for mobile processes with nominal data and logic. (English)
Comput. Res. Repos. 2011, Article No. 1101.3262 (2011).
4
Refinement types for secure implementations (English)
ACM Trans. Program. Lang. Syst. 33, No. 2, 8 (2011).
5
Verifying object-oriented programs with higher-order separation logic in coq (English)
ITP, 22-38 (2011).
6
Weak equivalences in psi-calculi (English)
LICS, 322-331 (2010).
7
Psi-calculi in Isabelle. (English)
Berghofer, Stefan (ed.) et al., Theorem proving in higher order logics. 22nd international conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03358-2/pbk). Lecture Notes in Computer Science 5674, 99-114 (2009).
8
Formalising the pi-calculus using nominal logic. (English)
Log. Methods Comput. Sci. 5, No. 2, Paper 16, 36 p., electronic only (2009).
9
Psi-calculi in isabelle (English)
TPHOLs, 99-114 (2009).
10
Psi-calculi: mobile processes, nominal data, and logic (English)
LICS, 39-48 (2009).
11
Formalising the pi-calculus using nominal logic. (English)
Comput. Res. Repos. 2008, Article No. 0809.3960 (2008).
12
Extended pi-calculi. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7‒11, 2008. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-70582-6/pbk). Lecture Notes in Computer Science 5126, 87-98 (2008).
13
Extended pi-calculi (English)
ICALP (2), 87-98 (2008).
14
Refinement types for secure implementations (English)
CSF, 17-32 (2008).
15
A completeness proof for bisimulation in the pi-calculus using isabelle. (English)
Electron. Notes Theor. Comput. Sci. 192, No. 1, 61-75 (2007).
16
Formalising the $π$-calculus using nominal logic. (English)
Seidl, Helmut (ed.), Foundations of software science and computational structures. 10th international conference, FOSSACS 2007, held as part of the joint European conferences on theory and practice of software, ETAPS 2007, Braga, Portugal, March 24 ‒ April 1, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-71388-3/pbk). Lecture Notes in Computer Science 4423, 63-77 (2007).
17
Formalising the {\it pi}-calculus using nominal logic (English)
FoSSaCS, 63-77 (2007).
18
Web services as a new approach to distributing and coordinating semantics-based veri cation toolkits. (English)
Electron. Notes Theor. Comput. Sci. 105, 11-20 (2004).
19
first | previous | 1 | next | last

Result 1 to 19 of 19 total