Result 1 to 20 of 55 total
Full abstraction for the resource lambda calculus with tests, through Taylor expansion. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 3, 44 p. (2012).
1
Computing strong and weak bisimulations for psi-calculi. (English)
J. Log. Algebr. Program. 81, No. 3, 162-180 (2012).
2
The relational model is injective for multiplicative exponential linear logic (without weakenings). (English)
Ann. Pure Appl. Logic 163, No. 9, 1210-1236 (2012).
3
Full abstraction for resource calculus with tests. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 97-111, electronic only (2011).
4
Ready simulation for concurrency: it’s logical! (English)
Inf. Comput. 208, No. 7, 845-867 (2010).
5
On the formal semantics of IF-like logics. (English)
J. Comput. Syst. Sci. 76, No. 5, 333-346 (2010).
6
Routing scalability in multi-domain DWDM networks. (English)
Photonic Netw. Commun. 17, No. 1, 63-74 (2009).
7
Expressing first-order $π$-calculus in higher-order calculus of communicating systems. (English)
J. Comput. Sci. Technol. 24, No. 1, 122-137 (2009).
8
Observational equivalence and full abstraction in the symmetric interaction combinators. (English)
Log. Methods Comput. Sci. 5, No. 4, Paper No. 6, 61 p., electronic only (2009).
9
From IF to BI. A tale of dependence and separation. (English)
Synthese 167, No. 2, 207-230 (2009).
10
Natural non-dcpo domains and f-spaces. (English)
Ann. Pure Appl. Logic 159, No. 3, 341-355 (2009).
11
Revivals, stuckness and the hierarchy of CSP models. (English)
J. Log. Algebr. Program. 78, No. 3, 163-190 (2009).
12
Inductive definition and domain theoretic properties of fully abstract models for PCF and PCF$^{+}$. (English)
Log. Methods Comput. Sci. 3, No. 3, Paper 7, 50 p., electronic only (2007).
13
Priority and abstraction in process algebra. (English)
Inf. Comput. 205, No. 9, 1426-1458 (2007).
14
Conjunction on processes: Full abstraction via ready-tree semantics. (English)
Theor. Comput. Sci. 373, No. 1-2, 19-40 (2007).
15
Securing the .NET programming model. (English)
Theor. Comput. Sci. 364, No. 3, 311-317 (2006).
16
Observability, connectivity, and replay in a sequential calculus of classes. (English)
de Boer, Frank S. (ed.) et al., Formal methods for components and objects. Third international symposium, FMCO 2004, Leiden, The Netherlands, November 2‒5, 2004. Revised lectures. Berlin: Springer (ISBN 3-540-29131-8/pbk). Lecture Notes in Computer Science 3657, 296-316 (2005).
17
On the expressive power of CSP refinement. (English)
Formal Asp. Comput. 17, No. 2, 93-112 (2005).
18
Object connectivity and full abstraction for a concurrent calculus of classes. (English)
Liu, Zhiming (ed.) et al., Theoretical aspects of computing ‒ ICTAC 2004. First international colloquium, Guiyang, China, September 20‒24, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-25304-1/pbk). Lecture Notes in Computer Science 3407, 37-51 (2005).
19
A fully abstract may testing semantics for concurrent objects. (English)
Theor. Comput. Sci. 338, No. 1-3, 17-63 (2005).
20
Result 1 to 20 of 55 total
Start
Contact
Print
General Help
