Result 1 to 20 of 139 total
Duality and I/O-types in the $π$-calculus. (English)
Koutny, Maciej (ed.) et al., CONCUR 2012 ‒ concurrency theory. 23rd international conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32939-5/pbk). Lecture Notes in Computer Science 7454, 302-316 (2012).
1
Strong normalisation in $λ$-calculi with references. (English)
Arbab, Farhad (ed.) et al., Fundamentals of software engineering. 4th IPM international conference, FSEN 2011, Tehran, Iran, April 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29319-1/pbk). Lecture Notes in Computer Science 7141, 128-142 (2012).
2
Introduction to bisimulation and coinduction. (English)
Cambridge: Cambridge University Press (ISBN 978-1-107-00363-7/hbk; 978-1-139-15378-2/ebook). xii, 247~p. \sterling~45.00; \$~80.00/hbk; \$~64.00/ebook (2012).
3
Advanced topics in bisimulation and coinduction. (English)
Cambridge Tracts in Theoretical Computer Science 52. Cambridge: Cambridge University Press (ISBN 978-1-107-00497-9/hbk). 340~p. \sterling~60.00/hbk (2011).
4
A component model for the ABS language. (English)
Aichernig, Bernhard K. (ed.) et al., Formal methods for components and objects. 9th international symposium, FMCO 2010, Graz, Austria, November 29‒December 1, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-25270-9/pbk). Lecture Notes in Computer Science 6957, 165-183 (2011).
5
Tools and verification. (English)
Wirsing, Martin (ed.) et al., Rigorous software engineering for service-oriented systems. Results of the SENSORIA project on software engineering for service-oriented computing. Berlin: Springer (ISBN 978-3-642-20400-5/pbk). Lecture Notes in Computer Science 6582, 408-427 (2011).
6
Ownership types for the join calculus. (English)
Bruni, Roberto (ed.) et al., Formal techniques for distributed systems. Joint 13th IFIP WG 6.1 international conference, FMOODS 2011, and 31st IFIP WG 6.1 international conference, FORTE 2011, Reykjavik, Iceland, June 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21460-8/pbk). Lecture Notes in Computer Science 6722, 289-303 (2011).
7
On the expressiveness and decidability of higher-order process calculi. (English)
Inf. Comput. 209, No. 2, 198-226 (2011).
8
Environmental bisimulations for higher-order languages (English)
ACM Trans. Program. Lang. Syst. 33, No. 1, 5 (2011).
9
Tools and verification (English)
Results of the SENSORIA Project, 408-427 (2011).
10
Ownership types for the join calculus (English)
FMOODS/FORTE, 289-303 (2011).
11
Termination in higher-order concurrent calculi. (English)
J. Log. Algebr. Program. 79, No. 7, 550-577 (2010).
12
A model of evolvable components. (English)
Wirsing, Martin (ed.) et al., Trustworthly global computing. 5th international symposium, TGC 2010, Munich, Germany, February 24‒26, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-15639-7/pbk). Lecture Notes in Computer Science 6084, 153-171 (2010).
13
Functions as processes: Termination and the $λμ\widetildeμ$-calculus. (English)
Wirsing, Martin (ed.) et al., Trustworthly global computing. 5th international symposium, TGC 2010, Munich, Germany, February 24‒26, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-15639-7/pbk). Lecture Notes in Computer Science 6084, 73-86 (2010).
14
On the expressiveness of polyadic and synchronous communication in higher-order process calculi. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-14161-4/pbk). Lecture Notes in Computer Science 6199, 442-453 (2010).
15
Termination in impure concurrent languages. (English)
Gastin, Paul (ed.) et al., CONCUR 2010 ‒ concurrency theory. 21th international conference, CONCUR 2010, Paris, France, August 31 ‒ September 3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15374-7/pbk). Lecture Notes in Computer Science 6269, 328-342 (2010).
16
An operational semantics for a calculus for wireless systems. (English)
Theor. Comput. Sci. 411, No. 19, 1928-1948 (2010).
17
Termination in higher-order concurrent calculi. (English)
Arbab, Farhad (ed.) et al., Fundamentals of software engineering. Third IPM international conference, FSEN 2009, Kish Island, Iran, April 15‒17, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11622-3/pbk). Lecture Notes in Computer Science 5961, 81-96 (2010).
18
A hybrid type system for lock-freedom of mobile processes (English)
ACM Trans. Program. Lang. Syst. 32, No. 5 (2010).
19
Light logics and higher-order processes (English)
EXPRESS’10, 46-60 (2010).
20
Result 1 to 20 of 139 total
Start
Contact
Print
General Help
