Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,664,975 papers from all fields of science
Search
Sign In
Create Free Account
Algebraic semantics (computer science)
Known as:
Algebraic semantics
In computer science, algebraic semantics is a form of axiomatic semantics based on algebraic laws for describing and reasoning about program…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Action semantics
Axiomatic semantics
Communicating sequential processes
Computer science
Expand
Broader (2)
Formal methods
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Observational implementation of algebraic specifications
R. Hennicker
Acta Informatica
2005
Corpus ID: 29922349
SummaryAn observational approach to the construction of implementations of algebraic specifications is presented. Based on the…
Expand
2000
2000
Algebraic Treatment of Feature-oriented Systems
Christophe Gaston
,
M. Aiguier
,
P. L. Gall
FIREworks workshop
2000
Corpus ID: 744049
An important aspect of the feature interaction problem is to formally capture the notion of feature interactions. Although this…
Expand
1999
1999
The Russell-Kaplan paradox and other modal paradoxes : A new solution
M. Oksanen
1999
Corpus ID: 16741722
The article considers some paradoxes that have been found in possible worlds semantics, such as the Russell-Kaplan paradox and a…
Expand
1999
1999
Automatic proofs of properties of simple C/sup --/ modules
Carine Fédèle
,
Emmanuel Kounalis
14th IEEE International Conference on Automated…
1999
Corpus ID: 14059606
We address the problem of automatically verifying properties of modules written in the C/sup --/ language, a very simple…
Expand
Review
1999
Review
1999
A Bilattice-Based Algebraic Semantics of Questions
I. Chierchia
,
B. Partee
1999
Corpus ID: 15639698
known to be true, known to be false, or unknown. This system allows us to uniformly assign both indicative and interrogative…
Expand
1995
1995
New Versions of Ask and Tell for Synchronous Communication in Concurrent Constraint Programming
Jean-Marie Jacquet
1995
Corpus ID: 17923058
Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new…
Expand
1995
1995
CPO models for in nite term rewriting ?
A. Corradini
,
Fabio GadducciUniversit
1995
Corpus ID: 14966087
Innnite terms in universal algebras are a well-known topic since the seminal work of the ADJ group 1]. The recent interest in the…
Expand
1992
1992
Introduction to LOTOS
L. F. Pires
1992
Corpus ID: 67049756
Lotos was developed to define implementation-independent formal standards of OSI services and protocols. ‘Lotos’ stands for…
Expand
1990
1990
Automatic generation of efficient compilers using abstract algebraic semantics
M. R. Anderson
1990
Corpus ID: 67725547
1988
1988
Positive/Negative Conditional Rewriting
S. Kaplan
Conditional and Typed Rewriting Systems
1988
Corpus ID: 28313639
This paper introduces positive/negative conditional term rewriting systems, with rules of the generic form: $$u = v \Lambda u…
Expand