Final semantics for event-pattern reactive programs

Lecture Notes in Computer Science

Volumn 3629, Issue , 2005, Pages 364-378

  Sánchez, César ^a   Sipma, Henny B ^a   Slanina, Matteo ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; OUTSOURCING;

EVENT-PATTERN REACTIVE PROGRAMS; FRONT-END PROGRAMS; TEMPORAL PATTERNS; VERIFICATION TECHNIQUES;

SEMANTICS;

EID: 26944435840     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11548133_23     Document Type: Conference Paper

References (20)

1. Marcos Kawazoe Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, and Tushar Deepak Chandra. Matching events in a content-based subscription system. In Symposium on Principles of Distributed Computing, pages 53-61, 1999.
2. Jos C. M. Baeten and W. Peter Weijland. Process Algebra. Cambridge University Press, 1990.
3. Antonio Carzaniga, David S. Rosenblum, and Alexander L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332-383, August 2001.
4. Corina Cîrstea. Semantic constructions from the specification of objects. Theoretical Computer Science, 260, 2001.
5. Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, 245(1), 2000.
6. Dina Q. Goldin. Persistent Turing Machines as a model of interactive computation. In Foundations of Information and Knowledge Systems, pages 116-135, Burg, Germany, February 2000.
7. Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computer Machinery, 32(1): 137-161, January 1985.
8. C. Antony R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
9. Frank Hunleth, Ron Cytron, and Christopher Gill. Building customizable middleware using aspect oriented programming. In Workshop on Advanced Separation of Concerns (OOPSLA '01), 2001.
10. Bart Jacobs and Jan J. M. M. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science, 62:222-259, 1997.
11. Stephen C. Kleene. Representation of events in nerve nets and finite automata. In Claude E. Shannon and John McCarthy, editors, Automata Studies, number 34, pages 3-41. Princeton University Press, Princeton, New Jersey, 1956.
12. Robert F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39-47, 1960.
13. Robin Milner. Communication and Concurrency. Prentice-Hall, 1989.
14. Grigore Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
15. Jan J. M. M. Rutten. Automata and coinduction (an exercise in coalgebra). In CONCUR, 1998.
16. César Sánchez, Sriram Sankaranarayanan, Henny B. Sipma, Ting Zhang, David Dill, and Zohar Manna. Event correlation: Language and semantics. In Rajeev Alur and Insup Lee, editors, EMSOFT 2003, pages 323-339. Spring-Verlag, 2003.
17. César Sánchez, Matteo Slanina, Henny B. Sipma, and Zohar Manna. Expressive completeness of an event-pattern reactive programming language. Submitted for publication.
18. Douglas C. Schmidt, David L. Levine, and Timothy H. Harrison. The design and performance of a real-time CORBA object event service. In Proc. of OOPSLA '97, 1997.
19. Bill Segall and David Arnold. Elvin has left the building: A publish/subscribe notification service with quenching. In Queensland AUUG Summer Technical Conference, Brisbane, Australia, 1997.
20. David Sharp. Reducing avionics software cost through component based product line development. In Proc. of the Software Technology Conference, 1998.