Proof theory for exception handling in a tasking environment

DOI10.1007/BF02983373zbMath0706.68076OpenAlexW1973153636MaRDI QIDQ918725

Kamal Lodaya, Rudrapatna K. Shyamasundar

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02983373

zbMATH Keywords

operational semanticsconcurrencynondeterminismexception handlingcommunicating sequential processestaskingAdacooperating proofs

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• Ada95

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof system for concurrent ADA programs
• Goto statements: Semantics and deduction systems
• An axiomatic proof technique for parallel programs
• Program proving: KJumps and functions
• Correct and Robust Programs
• Ada exception handling: an axiomatic approach
• A Proof System for Communicating Sequential Processes
• Proofs of Networks of Processes
• Formal Justification of a Proof System for Communicating Sequential Processes
• Communicating sequential processes

This page was built for publication: Proof theory for exception handling in a tasking environment