Idioma:

Mechanized Operational Semantics via (Co)Induction

Ambler, Simon J. ; Crole, Roy L. Bertot, Yves ; Thery, Laurent ; Dowek, Gilles ; Paulin, Christine ; Hirschowitz, Andre ; Hirschowitz, André ; Théry, Laurent ; Paulin, Christine ; Bertot, Yves ; Dowek, Gilles

Lecture notes in computer science, 1999, Vol.1690, p.221-238 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Mechanized Operational Semantics via (Co)Induction
Autor: Ambler, Simon J. ; Crole, Roy L.
Bertot, Yves ; Thery, Laurent ; Dowek, Gilles ; Paulin, Christine ; Hirschowitz, Andre ; Hirschowitz, André ; Théry, Laurent ; Paulin, Christine ; Bertot, Yves ; Dowek, Gilles
Assuntos: Abstract Syntax ; Applied sciences ; Computer science; control theory; systems ; Elimination Rule ; Exact sciences and technology ; Functional Programming ; High Order Logic ; Language theory and syntactical analysis ; Operational Semantic ; Theoretical computing
É parte de: Lecture notes in computer science, 1999, Vol.1690, p.221-238
Descrição: We give a fully automated description of a small programming language PL in the theorem prover Isabelle98. The language syntax and semantics are encoded, and we formally verify a range of semantic properties. This is achieved via uniform (co)inductive methods. We encode notions of bisimulation and contextual equivalence. The main original contribution of this paper is a fully automated proof that PL bisimulation coincides with PL contextual equivalence.
Títulos relacionados: Lecture Notes in Computer Science
Editor: Germany: Springer Berlin / Heidelberg
Idioma: Inglês

Links

Voltar para lista de resultados

Anterior Resultado 2 Avançar Ir para próxima página