Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Laurian M. Chirica

dblp:47/1398 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1986
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 55% Compilers and program optimization · 45%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › grammar formalisms
attribute grammars
0.021986
Toward Compiler Implementation Correctness Proofs · ACM Trans. Program. Lang. Syst. 1986
An Algebraic Formulation of Knuthian Semantics · FOCS 1976
Compilers and program optimization › verified compilation
compiler correctness proof
0.011986
Toward Compiler Implementation Correctness Proofs · ACM Trans. Program. Lang. Syst. 1986
Programming languages and type systems
language semantics
0.011986
Toward Compiler Implementation Correctness Proofs · ACM Trans. Program. Lang. Syst. 1986
Compilers and program optimization
verified compilation
0.011986
Toward Compiler Implementation Correctness Proofs · ACM Trans. Program. Lang. Syst. 1986
Compilers and program optimization › compiler construction
syntax-directed translation
0.011986
Toward Compiler Implementation Correctness Proofs · ACM Trans. Program. Lang. Syst. 1986
Programming languages and type systems › language semantics › formal semantics
algebraic semantics
0.011976
An Algebraic Formulation of Knuthian Semantics · FOCS 1976
Programming languages and type systems › language semantics
formal semantics
0.011976
An Algebraic Formulation of Knuthian Semantics · FOCS 1976
Programming languages and type systems › language semantics › formal semantics › denotational semantics
initial algebra semantics
0.011976
An Algebraic Formulation of Knuthian Semantics · FOCS 1976

Methods — techniques the papers use, named apart from their topics

translation invariant · 0.0order-algebraic framework · 0.0inductive assertions · 0.0initial algebra semantics · 0.0algebraic specification · 0.0
YearPublicationVenuePosition
1986 Toward Compiler Implementation Correctness Proofs
abstract
Aspect of the interaction between compiler theory and practice is addressed. Presented is a technique for the syntax-directed specification of compilers together with a method for proving the correctness of their parse-driven implementations. The subject matter is presented in an order-algebraic framework; while not strictly necessary, this approach imposes beneficial structure and modularity on the resulting specifications and implementation correctness proofs. Compilers are specified using an order-algebraic definition of attribute grammars. A practical class of compiler implementations is considered, consisting of those driven by LR( k ) or LL( k ) parsers which cause a sequence of translation routine activations to modify a suitably initialized collection of data structures (called a translation environment). The implementation correctness criterion consists of appropriately comparing, for each source program, the corresponding object program (contained in the final translation environment) produced by the compiler implementation to the object program dictated by the compiler specification. Provided that suitable intermediate assertions (called translation invariants ) are supplied, the program consisting of the (parse-induced) sequence of translation routine activations can be proven partially correct via standard inductive assertion methods.
Laurian M. Chirica, David F. Martin
ACM Trans. Program. Lang. Syst.1
1979 An Order-Algebraic Definition of Knuthian Semantics
Laurian M. Chirica, David F. Martin
Math. Syst. Theory1
1976 An Algebraic Formulation of Knuthian Semantics
abstract
This paper presents a formulation, within the framework of initial algebra semantics, of Knuthian semantic systems (K-systems) which contain both synthesized and inherited attributes. This formulation permits a precise definition of K-systems, and combines their intuitive appeal with the theoretical power of algebraic methods. The basic approach consists of algebraically specifying the semantic portion of a given K-system, converting this K-system into another equivalent one which contains only synthesized attributes, and then defining the new equivalent K-system by means of an algebraic formulation. The practical implications of the algebraic definition of K-systems are discussed, and the combined use of Knuth's original formulation and the algebraic approach for the development of semantic definitions is advocated.
Laurian M. Chirica, David F. Martin
FOCS1