Suchergebnisse - Theory of computation Semantics and reasoning Program semantics Algebraic semantics

Compositional Semantics for Probabilistic Programs with Exact Conditioning von Stein, Dario, Staton, Sam

“… We give operational, denotational and equational semantics for this language, establishing convenient properties like exchangeability of conditions …”
Volltext

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning von Mio, Matteo, Sarkis, Ralph, Vignudelli, Valeria

“… We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics …”
Volltext

Behavioural Preorders via Graded Monads von Ford, Chase, Milius, Stefan, Schroder, Lutz

“… Often, such behavioural preorders are characterized in terms of theory inclusion in dedicated characteristic logics; e.g …”
Volltext

Fixed-Points for Quantitative Equational Logics von Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“… We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras …”
Volltext

An Algebraic Characterisation of First-Order Logic with Neighbour von Manuel, Amaldev, Nevatia, Dhruv

“… We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words …”
Volltext

Programs for Cheap von Hackett, Jennifer, Hutton, Graham

“… Write down the definition of a recursion operator on a piece of paper. Tell me its type, but be careful not to let me see the operator's definition. I will …”
Volltext

Feature-Oriented Programming and the AHEAD Tool Suite von Batory, Don

“… , personal computers,automobiles). FOP technology translates suchdeclarative specifications into efficient programs …”
Volltext

Revisiting Statechart Synthesis with an Algebraic Approach von Ziadi, Tewfic, Helouet, Loic, Jezequel, Jean-Marc

“… Inspired by the way UML2.0 sequence diagrams can be algebraically composed, we first define an algebraic framework for composing state charts …”
Volltext

Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code von Shashidhar, K. C., Bruynooghe, Maurice, Catthoor, Francky, Janssens, Gerda

“… Designers applying such nontrivial source code transformations are often faced with the problem of ensuring functional equivalence of the original and transformed programs …”
Volltext

A Tool for Writing and Debugging Algebraic Specifications von Henkel, Johannes, Diwan, Amer

“… To address these issues,we present a tool that helps programmers write anddebug algebraic specifications …”
Volltext

Towards a formal semantics of Parnas tables von Janicki, Ryszard

“… In Parnas at al. advocate the use of relational model for documenting the intended behaviour of programs …”
Volltext

A Denotational Semantics for Deliberation Dialogues von McBurney, Peter, Parsons, Simon

“… We present a denotational semantics for agent deliberation dialogues, i.e., dialogues over proposed actions, conducted under a broad class of interaction protocols …”
Volltext

CCML: A Novel Service Composition Language von Zhang, Xiuguo, Zhang, Weishi

“… Interaction rules among services rely on a cooperative computation model, i.e. KPN (Kahn Process Network …”
Volltext

Ontological Feedback in Multiagent Systems von Beun, Robbert-Jan, van Eijk, Rogier M., Prust, Huub

“… with the recipientýs ontology, which is expressed in type theory. Discrepancies are detected by the receiving agent if it notices type conflicts, particular inconsistencies or ontological gaps …”
Volltext

A Logic for Locally Complete Abstract Interpretations von Bruni, Roberto, Giacobazzi, Roberto, Gori, Roberta, Ranzato, Francesco

“… We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program specification …”
Volltext

Encoding Abstract Descriptions into Executable Web Services: Towards a Formal Development von Chirichiello, Antonella, Salaun, Gwen

“… From such formal descriptions, reasoning tools can be used to validate their correct execution. We define some guidelines to encode abstract specifications of services-to-be written using these calculi into executable web services …”
Volltext

A Theorem Proving Approach to Programming Language Semantics von Roy, Subhajit

“… We show that once the program and its semantics are encoded, modern proof assistants can prove exciting language features with minimal …”
Volltext

A Relational Theory of Monadic Rewriting Systems, Part I von Gavazzo, Francesco, Faggian, Claudia

“… Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems …”
Volltext

Positive First-order Logic on Words von Kuperberg, Denis

“… We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable …”
Volltext

Abstracting algebraic effects von Biernacki, Dariusz, Piróg, Maciej, Polesiuk, Piotr, Sieczkowski, Filip

“… Proposed originally by Plotkin and Pretnar, algebraic effects and their handlers are a leading-edge approach to computational effects …”
Volltext