Generating language-based environments
Generating language-based environments
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Correctness-preserving program transformations
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Discipline of Programming
An Introduction to the PL/CV2 Programming Logic
An Introduction to the PL/CV2 Programming Logic
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
A Computer System for Checking Proofs
A Computer System for Checking Proofs
AVID: A system for the Interactive Development of Verifiably Correct Programs
AVID: A system for the Interactive Development of Verifiably Correct Programs
Proofs as Programs
Combining parsing and evaluation for attributed grammars.
Combining parsing and evaluation for attributed grammars.
ICSE '88 Proceedings of the 10th international conference on Software engineering
Incremental computation via function caching
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
Toward tools to support the Gries/Dijkstra design process
ACM SIGSOFT Software Engineering Notes
Remote attribute updating for language-based editors
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Nordic Journal of Computing
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
| Hi-index | 0.00 |
Knowledge of logical inference rules allows a specialized proof editor to provide a user with feedback about errors in a proof under development. Providing such feedback involves checking a collection of constraints on the strings of the proof language. Because attribute grammars allow such constraints to be expressed in a modular, declarative fashion, they are a suitable underlying formalism for a proof-checking editor. This paper discusses how an attribute grammar can be used in an editor for partial-correctness program proofs in Hoare-style logic, where verification conditions are proved using the sequent calculus.