Back-forth equivalences for design of concurrent systems (English)
- New search for: Tarasyuk, Igor V.
- New search for: Tarasyuk, Igor V.
In:
Logical Foundations of Computer Science
;
374-384
;
1997
- Article/Chapter (Book) / Electronic Resource
-
Title:Back-forth equivalences for design of concurrent systems
-
Contributors:Tarasyuk, Igor V. ( author )
-
Published in:Logical Foundations of Computer Science ; 374-384Lecture Notes in Computer Science ; 1234 ; 374-384
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1997-01-01
-
Size:11 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Topological semantics for hybrid systemsArtemov, Sergei / Davoren, Jennifer / Nerode, Anil et al. | 1997
- 9
-
Domain-free pure type systemsBarthe, Gilles / SØrensen, Morten Heine et al. | 1997
- 21
-
Generic queries over quasi-o-minimal domainsBelegradek, Oleg V. / Stolboushkin, Alexei P. / Taitslin, Michael A. et al. | 1997
- 33
-
Towards computing distances between programs via Scott domainsBukatin, Michael A. / Scott, Joshua S. et al. | 1997
- 44
-
A safe recursion scheme for exponential timeClote, Peter et al. | 1997
- 53
-
Finite model theory, universal algebra and graph grammarsCourcelle, Bruno et al. | 1997
- 56
-
Complexity of query answering in logic databases with complex valuesDantsin, Evgeny / Voronkov, Andrei et al. | 1997
- 67
-
Recognition of deductive data base stabilityDekhtyar, Michael I. / Dikovsky, Alexander et al. | 1997
- 78
-
The concurrency complexity for the Horn fragment of linear logicDudakov, Sergey M. et al. | 1997
- 88
-
Studying algorithmic problems for free semi-groups and groupsDurnev, Valery et al. | 1997
- 102
-
Learning small programs with additional informationFreivalds, Rüsiņš / Tervits, Gints / Wiehagen, Rolf / Smith, Carl et al. | 1997
- 113
-
Cut elimination for the second order propositional logic with Hilbert's ε-symbol, extensionality, and full comprehensionGavrilovich, Michael et al. | 1997
- 119
-
Finite bases of admissible rules for the logic S52 CGolovanov, Mikhail et al. | 1997
- 130
-
An algebraic correctness criterion for intuitionistic proof-netsGroote, Philippe et al. | 1997
- 141
-
Towards a theory of recursive structuresHarel, David et al. | 1997
- 145
-
On the complexity of prefix formulas in modal logic of subset spacesHeinemann, Bernhard et al. | 1997
- 156
-
The undecidability of second order linear affine logicKopylov, Alexei P. et al. | 1997
- 167
-
Operational logic of proofs with functionality condition on proof predicateKrupski, Vladimir N. et al. | 1997
- 178
-
On linear ordering of strongly extensional finitely-branching graphs and non-well-founded setsLisitsa, Alexei / Sazonov, Vladimir et al. | 1997
- 189
-
Functions for the general solution of parametric word equationsMakanin, G. S. / Abdulrab, H. / Goralcik, P. et al. | 1997
- 203
-
A proof procedure for hereditary Harrop formulas with free equalityMakarov, Evgeny et al. | 1997
- 214
-
Basic forward chaining construction for logic programsMarek, V. W. / Nerode, A. / Remmel, J. B. et al. | 1997
- 226
-
Decidability and undecidability of the halting problem on Turing machines, a surveyMargenstern, Maurice et al. | 1997
- 237
-
Case study: Additive linear logic and latticesMarion, Jean-Yves et al. | 1997
- 248
-
Some decision problems for tracesMatiyasevich, Yuri et al. | 1997
- 258
-
Existential instantiation and strong normalizationMints, G. et al. | 1997
- 266
-
Models for the logic of proofsMkrtychev, Alexey et al. | 1997
- 276
-
Interpretation of the full computation tree logic CTL* on sets of infinite sequencesNitsche, Ulrich et al. | 1997
- 283
-
Type introduction for equational rewritingOhsaki, Hitoshi / Middeldorp, Aart et al. | 1997
- 294
-
Capturing bisimulation-invariant PtimeOtto, Martin et al. | 1997
- 306
-
Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logicPentus, Mati et al. | 1997
- 312
-
A decidable fragment of second order linear logicPerrier, G. et al. | 1997
- 323
-
Some results on Propositional Dynamic Logic with fixed pointsRents, Igor / Shilov, Nikolaj et al. | 1997
- 333
-
Quasi-characteristic inference rules for modal logicsRybakov, Vladimir V. et al. | 1997
- 342
-
Provability logic with operations on proofsSidon, Tatiana et al. | 1997
- 354
-
Formal verification of logic programs: Foundations and implementationStärk, Robert F. et al. | 1997
- 369
-
Unification of terms with term-indexed variablesTandetnik, Igor L. et al. | 1997
- 374
-
Back-forth equivalences for design of concurrent systemsTarasyuk, Igor V. et al. | 1997
- 385
-
Association nets: An alternative formalization of common thinkingTseytin, G. S. et al. | 1997
- 399
-
Simulating η-expansions with Β-reductions in the second-order polymorphic λ-rcalculusXi, Hongwei et al. | 1997
- 410
-
Logical schemes for first order theoriesYavorsky, Rostislav E. et al. | 1997
- 419
-
Verification of PLTL formulae by means of monotone disjunctive normal formsZakharov, Vladimir et al. | 1997