Matteo Slanina, Ph.D.
Affiliations: | 2007 | Stanford University, Palo Alto, CA |
Area:
Computer ScienceGoogle:
"Matteo Slanina"Parents
Sign in to add mentor| Zohar Manna | grad student | 2007 | Stanford | |
| (Deductive verification of alternating systems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Slanina M, Sipma HB, Manna Z. (2008) Deductive verification of alternating systems Formal Aspects of Computing. 20: 507-560 |
| Sánchez C, Slanina M, Sipma HB, et al. (2008) The reaction algebra: A formal language for event correlation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4800: 596-619 |
| Slanina M, Sipma HB, Manna Z. (2006) Proving ATL* properties of infinite-state systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4281: 242-256 |
| Sánchez C, Sipma HB, Slanina M, et al. (2005) Final semantics for event-pattern reactive programs Lecture Notes in Computer Science. 3629: 364-378 |
| Sánchez C, Slanina M, Sipma HB, et al. (2005) Expressive completeness of an event-pattern reactive programming language Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3731: 529-532 |
| Montanari A, Policriti A, Slanina M. (2002) Alternative translation techniques for propositional and first-order modal logics Journal of Automated Reasoning. 28: 397-415 |