Bild mit Unilogo
homeicon university sucheicon search siteicon sitemap kontakticon contact impressicon legal notice
unilogo University of Stuttgart 
Institute of Formal Methods in Computer Science

SZS - Publications by Alin Stefanescu

 

2006

Alin Stefanescu. Automatic synthesis of distributed transition systems. PhD thesis, Universität Stuttgart, February 2006.
PDF (2 MB)
Info
Slides 

2005

Keijo Heljanko and Alin Stefanescu. Complexity results for checking distributed implementability. In Proceedings of the 5th International Conference on Application of Concurrency to System Design (ACSD 2005), pages 78–87, 2005.
GZipped PostScript (119 kB)
PDF (258 kB)
Info
Slides 
Tech report version

2004

Keijo Heljanko and Alin Stefanescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Universität Stuttgart, 2004.
PDF (324 kB)
Info
Slides 

2003

Alin Stefanescu, Javier Esparza, and Anca Muscholl. Synthesis of distributed algorithms using asynchronous automata. In R. Amadio and D. Lugiez, editors, Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761, pages 27–41. Springer, September 2003.
PDF (242 kB)
Info
Full versionSlidesImplementation

2002

Alin Stefanescu. Automatic synthesis of distributed systems. In Proceedings of 17th IEEE International Conference on Automated Software Engineering, page 315. IEEE Computer Society, 2002. Position paper.
GZipped PostScript (56 kB)
Info
See www.fmi.uni-stuttgart.de ...
Slides 

2000

Alin Stefanescu. Flownomial calculus: From theory to practice. Master's thesis, University of Bucharest, 2000. In Romanian.
GZipped PostScript (264 kB)
Info
See www.fmi.uni-stuttgart.de ...