Results 41 to 50 of about 1,138,309 (354)
Maude: specification and programming in rewriting logic [PDF]
, 2002 Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming
Clavel, M. +6 more
core +3 more sources
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc, including a rewriting logic semantics developed by the authors.
José Meseguer, Musab AlTurki
doaj +1 more source
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic [PDF]
Logical Methods in Computer Science, 2022 Message passing is a useful abstraction for implementing concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency,
Jonas Kastberg Hinrichsen +2 more
doaj +1 more source
Non Linear Programming (NLP) formulation for quantitative modeling of protein signal transduction pathways. [PDF]
PLoS ONE, 2012 Modeling of signal transduction pathways plays a major role in understanding cells' function and predicting cellular response. Mathematical formalisms based on a logic formalism are relatively simple but can describe how signals propagate from one ...
Alexander Mitsos +5 more
doaj +1 more source
Verification of Programs via Intermediate Interpretation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin's supercompilation is used to specialize some interpreters with respect to the ...
Alexei P. Lisitsa, Andrei P. Nemytykh
doaj +1 more source
Poster Presentation: Xcerpt and XChange – Logic Programming Languages for Querying and Evolution on the Web [PDF]
, 2004 age Xcerpt and provides advanced, Web-specific capabilities, such as propagation of changes on the Web (change) and event-based communications between Web sites (exchange).
Bry, François +2 more
core +3 more sources
An Algebra of Synchronous Scheduling Interfaces [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous ...
Michael Mendler
doaj +1 more source
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version) [PDF]
Proc. ACM Program. Lang. 8, PLDI, Article 207 (June 2024), 2023 Hoare logics are proof systems that allow one to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness). Hoare logic has been generalized to prove also properties of multiple executions of a program (so-called hyperproperties, such as determinism or
arxiv +1 more source
Logic and functional programming by retractions [PDF]
RAIRO - Theoretical Informatics and Applications, 1988 Application de la notion de retraction dans la representation de relations calculables. Une sous-classe stricte de retraction est definie. Cette classe de fonctions est alors discutee dans une theorie des ensembles qui est construite en accord avec la structure de l'Univers d'Herbrand en logique clausale. Cette approche fournit un paradigme fonctionnel
openaire +3 more sources
Logic programming, functional programming, and inductive definitions [PDF]
, 2006 An attempt at unifying logic and functional programming is reported. As a starting point, we take the view that "logic programs" are not about logic but constitute inductive definitions of sets and relations. A skeletal language design based on these considerations is sketched and a prototype implementation discussed.
Andrew W. Smith, Lawrence C. Paulson
openaire +3 more sources