|
Search the dblp DataBase
Daniele Varacca:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Daniele Varacca
Encoding CDuce in the Cpi-Calculus. [Citation Graph (0, 0)][DBLP] CONCUR, 2006, pp:310-326 [Conf]
- Hagen Völzer, Daniele Varacca, Ekkart Kindler
Defining Fairness. [Citation Graph (0, 0)][DBLP] CONCUR, 2005, pp:458-472 [Conf]
- Daniele Varacca, Hagen Völzer, Glynn Winskel
Probabilistic Event Structures and Domains. [Citation Graph (0, 0)][DBLP] CONCUR, 2004, pp:481-496 [Conf]
- Giuseppe Castagna, Rocco De Nicola, Daniele Varacca
Semantic Subtyping for the p-Calculus. [Citation Graph (0, 0)][DBLP] LICS, 2005, pp:92-101 [Conf]
- Daniele Varacca
The Powerdomain of Indexed Valuations. [Citation Graph (0, 0)][DBLP] LICS, 2002, pp:299-0 [Conf]
- Daniele Varacca, Hagen Völzer
Temporal Logics and Model Checking for Fairly Correct Systems. [Citation Graph (0, 0)][DBLP] LICS, 2006, pp:389-398 [Conf]
- Daniele Varacca, Nobuko Yoshida
Typed Event Structures and the pi-Calculus: Extended Abstract. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:373-397 [Journal]
- Daniele Varacca, Hagen Völzer, Glynn Winskel
Probabilistic event structures and domains. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:358, n:2-3, pp:173-199 [Journal]
- Silvia Crafa, Daniele Varacca, Nobuko Yoshida
Compositional Event Structure Semantics for the Internal pi -Calculus. [Citation Graph (0, 0)][DBLP] CONCUR, 2007, pp:317-332 [Conf]
- Daniele Varacca, Nobuko Yoshida
Probabilistic pi-Calculus and Event Structures. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:190, n:3, pp:147-166 [Journal]
Counterexamples in Probabilistic LTL Model Checking for Markov Chains. [Citation Graph (, )][DBLP]
The Calculus of Handshake Configurations. [Citation Graph (, )][DBLP]
Fair Adversaries and Randomization in Two-Player Games. [Citation Graph (, )][DBLP]
Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths. [Citation Graph (, )][DBLP]
A Petri Net Model of Handshake Protocols. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|