48,447 Hits in 4.5 sec

An Algebraic Framework for Compositional Program Analysis [article]

Azadeh Farzan, Zachary Kincaid
2013 arXiv   pre-print
This paper presents algebraic framework for designing, implementing, and proving the correctness of compositional program analyses.  ...  Lastly, we develop a theory for proving the correctness of an analysis by establishing an approximation relationship between an algebra defining a concrete semantics and an algebra defining an analysis  ...  Table 8 Conclusion and Related work In this paper, we presented an algebraic framework for compositional program analysis.  ... 
arXiv:1310.3481v1 fatcat:42sj26xl5jbe5iasdgczyi4vpe

Modular and generic programming with interpreterlib

Philip Weaver, Garrin Kimmell, Nicolas Frisby, Perry Alexander
2007 Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering - ASE '07  
In addition to modular analyses composition, InterpreterLib provides algebra combinators, explicit algebra semantics, preprocessors for boilerplate generation and generic programming techniques adapted  ...  to language analysis.  ...  Similarly to the composition of syntactic functors and value spaces, InterpreterLib contains an operator that allows two semantic algebras, for two different functors, to be combined into a single algebra  ... 
doi:10.1145/1321631.1321712 dblp:conf/kbse/WeaverKFA07 fatcat:5whklitdencqhnrly5ijwqakda

OpenMETA: A Model- and Component-Based Design Tool Chain for Cyber-Physical Systems [chapter]

Janos Sztipanovits, Ted Bapty, Sandeep Neema, Larry Howard, Ethan Jackson
2014 Lecture Notes in Computer Science  
This challenge is compounded by the need for rapidly evolving the design flow by changing/updating the selection of modeling languages, analysis and verification tools and synthesis methods.  ...  This paper will examine the OpenMETA technical approach to construct the new integration layers, provides and overview of the technical framework we established for their implementation and summarize our  ...  purely algebraic specifications it provides a clear execution semantics for logic programs making it possible to specify model transformations in the same framework.  ... 
doi:10.1007/978-3-642-54848-2_16 fatcat:3kryhumez5aovfp6wx7xkgtzsu

Algebraic Program Analysis [chapter]

Zachary Kincaid, Thomas Reps, John Cyphert
2021 Lecture Notes in Computer Science  
It explains the foundations of algebraic program analysis, its strengths and limitations, and gives examples of algebraic program analyses for numerical invariant generation and termination analysis.  ...  AbstractThis paper is a tutorial on algebraic program analysis.  ...  Algebraic program analysis is a general framework for understanding compositional program analyses.  ... 
doi:10.1007/978-3-030-81685-8_3 fatcat:375brjonbbgfdfwpp72juwnljq

Termination Analysis Without the Tears [article]

Shaowei Zhu, Zachary Kincaid
2021 arXiv   pre-print
This paper presents a termination analysis that is both compositional (the result of analyzing a composite program is a function of the analysis results of its components) and monotone ("more information  ...  The first is an extension of Tarjan's method for solving path problems in graphs to solve infinite path problems. This provides a foundation upon which to build compositional termination analyses.  ...  The algebraic framework "lifts" a termination analysis for transition formulas to whole programs.  ... 
arXiv:2101.09783v1 fatcat:hipzhvwlxbcgdfnjwmdrt6cof4


G. Scollo, T. Rus
1995 Theoretical Computer Science  
The author argues that the proper context for dealing with many aspects of object-oriented programming is imperative, whence his framework is built on a memory model.  ...  Sanchez, in the article On the correctness ofmodular systems, address the algebraic development of modular systems by introducing an abstract framework which allows one to deal with incompletely specified  ... 
doi:10.1016/0304-3975(95)90079-9 fatcat:2m3kjfgr25h5di6qn3tv3d3teq

Page 520 of Mathematical Reviews Vol. , Issue 2002A [page]

2002 Mathematical Reviews  
where scheduling theory analysis is used and actual program execution time is taken into account.  ...  Systems with in- finitary compositions of quasiary and set types are investigated The complete class of propositional compositions on the class of partial nondeterministic predicates is defined, its algebraic  ... 

Formal Aspects of Component Software (FACS 2010 selected and extended papers)

Luís Soares Barbosa, Markus Lumpe
2014 Science of Computer Programming  
Process calculi provide an elegant framework for algebraic characterization of software components and component interaction.  ...  , for the verification and analysis of adaptive service components and their compositions.  ...  Bonsangue, Stijn de Gouw, and Mohammad Mahdi Jaghoori present JMSeq, a framework for monitoring sequences of method calls in Java programs.  ... 
doi:10.1016/j.scico.2014.03.010 fatcat:euxsvofacjfhdmrb6unokikrji

Separating concurrent languages with categories of language embeddings

Ehud Shapiro
1991 Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91  
We feel that our approach is more suitable as an abstract framework for the study of programming lan- guages and, more generally, families of languages with a syntactic structure and a  ...  Programming languages contain restrictions on program composition that can- not be modeled by many-sorted algebras. One of our separation results is based on this phenomenon.  ... 
doi:10.1145/103418.103423 dblp:conf/stoc/Shapiro91 fatcat:bx5otjtn4fgtvb7iqnanmkht5u

Evaluation of Parallel System using Process Algebra

We use the concept of process algebra, it is an algebraic technique for the study of execution of parallel processes.  ...  Here we use concept of markov chain analysis for execution of the concurrent processes.  ...  For analysis of system behaviour we use model checker and equivalence checker [2] .TAPA is a software program for supporting specification and analysis of concurrent systems via process Algebra.  ... 
doi:10.35940/ijitee.i1034.0789s219 fatcat:v5ofcjepijc5pbkbxmwkdrrs6e

Editorial for the Special Issue on Open Problems in Concurrency Theory

Marco Bernardo, Daniel Gebler, Michele Loreti
2015 Journal of Logical and Algebraic Methods in Programming  
An alternative approach to sequential composition based on a symmetric binary operator and write-many variables is proposed.  ...  In the first paper, "The role of concurrency in an evolutionary view of programming abstractions", the author examines how concurrency has been embodied in mainstream programming languages and discuss  ...  In the paper "A coalgebraic semantics for causality in Petri nets", the authors propose coalgebras on a presheaf category on an index category of partial orders as a model for causality in Petri nets.  ... 
doi:10.1016/j.jlamp.2015.10.002 fatcat:wlhmlgzgufeu7ofu3as3qsq22i


Dimitra Giannakopoulou, Gwen Salaün, Michael Butler
2016 Formal Aspects of Computing  
This paper proposes a formal and general framework for architecture composability based on an associative, commutative and idempotent architecture composition operator.  ...  To do so, the authors extend the formalisation for variants of Kleene algebras in Isabelle/HOL with Kleene algebras with tests, which are of interest to program construction and correctness applications  ... 
doi:10.1007/s00165-016-0368-0 fatcat:mvzd6cu7cff2pj2l3phcqekbja

Reasoning about Programs With Effects

Carolyn Talcott
1998 Electronical Notes in Theoretical Computer Science  
Talcott actor model of computation and has focused on developing semantic models for modular speci cation and composition of actor systems.  ...  This work has focused on operationally based semantics and formalisms for specifying and reasoning about such programs.  ...  A component algebra consists of a set of components which contains an empty component, together with an operation mapping components to their interface, and three additional operations: parallel composition  ... 
doi:10.1016/s1571-0661(05)80243-9 fatcat:b6mazjhf2rao3erdapa3qcwoti

Page 7543 of Mathematical Reviews Vol. , Issue 2002J [page]

2002 Mathematical Reviews  
Subsequently the authors present a constraint-based framework for the inter-procedural analysis of fork/join programs arising from an algebraic reformulation of the method described by J.  ...  Program construct encodings are: pq for composition “p;q”, bp +bgq for conditionals “if b then p else q”, (bp) *b for iterations “while b do p”.  ... 

Page 7320 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
This yields a compositional class of Petri nets, as well as a framework for trans- lating CCS into Petri nets, and thus a causality-based semantics for CCS is obtained.  ...  The author proposes an extension of cooperating proofs for CCS [K. R. Apt, the author and W. P. de Roever, ACM Trans. Program- ming Lang.  ... 
« Previous Showing results 1 — 15 out of 48,447 results