Abstract is missing.
- A.P. Ershov - A Pioneer and a Leader of National ProgrammingIgor V. Pottosin. 1-7 [doi]
- A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic ConceptsRimma I. Podlovchenko. 8-23 [doi]
- The Abstract State Machine Paradigm: What Is in and What Is outYuri Gurevich. 24 [doi]
- On Algorithmic UnsolvabilitySvyatoslav Sergeevich Lavrov. 25-32 [doi]
- Resolution and Binary Decision Diagrams Cannot Simulate Each Other PolynomiallyJan Friso Groote, Hans Zantema. 33-38 [doi]
- On Expressive and Model Checking Power of Propositional Program LogicsNikolay V. Shilov, Kwang Yi. 39-46 [doi]
- An Extension of Dynamic Logic for Modelling OCL s @pre OperatorThomas Baar, Bernhard Beckert, Peter H. Schmitt. 47-54 [doi]
- Optimal Algorithms of Event-Driven Re-evaluation of Boolean FunctionsValeriy Vyatkin. 55-63 [doi]
- A Transformation of SDL Specifications - A Step towards the VerificationNatalia Ioustinova, Natalia Sidorova. 64-78 [doi]
- Accurate Widenings and Boundedness Properties of Timed SystemsSupratik Mukhopadhyay, Andreas Podelski. 79-94 [doi]
- Adaptive Saturation-Based ReasoningAlexandre Riazanov, Andrei Voronkov. 95-108 [doi]
- A Verification Approach for Distributed Abstract State MachinesRobert Eschbach. 109-115 [doi]
- Transformational Construction of Correct Pointer AlgorithmsThorsten Ehm. 116-130 [doi]
- A Theoretical Foundation of Program Synthesis by Equivalent TransformationKiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi. 131-139 [doi]
- Equivalent Transformation by Safe Extension of Data StructuresKiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi. 140-148 [doi]
- Semantics and Transformations in Formal Synthesis at System LevelViktor K. Sabelfeld, Christian Blumenröhr, Kai Kapp. 149-156 [doi]
- Automated Program Synthesis for Java Programming LanguageMait Harf, Kristiina Kindel, Vahur Kotkas, Peep Küngas, Enn Tyugu. 157-164 [doi]
- The Varieties of Programming Language SemanticsPeter D. Mosses. 165-190 [doi]
- Binding-Time Analysis for Polymorphic TypesRogardt Heldal, John Hughes. 191-204 [doi]
- An Investigation of Compact and Efficient Number Representations in the Pure Lambda CalculusTorben Æ. Mogensen. 205-213 [doi]
- Observational Semantics for Timed Event StructuresIrina Virbitskaite. 214-224 [doi]
- The Impact of Synchronisation on Secure Information Flow in Concurrent ProgramsAndrei Sabelfeld. 225-239 [doi]
- Dynamical Priorities without Time Measurement and Modification of the TCPValery A. Sokolov, Eugeny A. Timofeev. 240-245 [doi]
- From ADT to UML-Like ModellingEgidio Astesiano, Maura Cerioli, Gianna Reggio. 246 [doi]
- Transformation of UML Specification to XTGElla E. Roubtsova, Jan van Katwijk, Ruud C. M. de Rooij, Hans Toetenel. 247-254 [doi]
- A Systematic Approach towards Object-Based Petri Net FormalismsBerndt Farwer, Irina A. Lomazova. 255-267 [doi]
- Unfoldings of Coloured Petri NetsVitaly E. Kozura. 268-278 [doi]
- A Net-Based Multi-tier Behavior Inheritance Modelling MethodShengyuan Wang, Jian Yu, Chongyi Yuan. 279-286 [doi]
- Specification Based Testing: Towards PracticeAlexandre Petrenko. 287-300 [doi]
- Java Specification Extension for Automated Test DevelopmentIgor B. Bourdonov, Alexey V. Demakov, Andrew A. Jarov, Alexander Kossatchev, Victor V. Kuliamin, Alexander K. Petrenko, Sergey V. Zelenov. 301-307 [doi]
- Specification-Based Testing of FirewallsJan Jürjens, Guido Wimmel. 308-316 [doi]
- Academic vs. Industrial Software Engineering: Closing the GapAndrey N. Terekhov, Len Erlikh. 317-323 [doi]
- A Method for Recovery and Maintenance of Software ArchitectureD. V. Koznov, Konstantin Romanovsky, Alexei Nikitin. 324-327 [doi]
- An Empirical Study of Retargetable CompilersDmitri Boulytchev, Dmitry Lomov. 328-335 [doi]
- Conceptual Data Modeling: An Algebraic ViewpointS. Kazem Lellahi. 336-348 [doi]
- Integrating and Managing Conflicting DataSergio Greco, Luigi Pontieri, Ester Zumpano. 349-362 [doi]
- A Knowledge Engineering Approach to Deal with Narrative Multimedia DocumentsGian Piero Zarri. 363-377 [doi]
- Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic ApproachVladimir Yu. Sazonov. 378-394 [doi]
- Reexecution-Based Analysis of Logic Programs with Delay DeclarationsAgostino Cortesi, Baudouin Le Charlier, Sabina Rossi. 395-405 [doi]
- Pos(T): Analyzing Dependencies in Typed Logic ProgramsMaurice Bruynooghe, Wim Vanhoof, Michael Codish. 406-420 [doi]
- A Prolog Tailoring Technique on an Epilog Tailored ProcedureYoon-chan Jhi, Ki-Chang Kim, Kemal Ebcioglu, Yong-Surk Lee. 421-433 [doi]
- Hierarchical Constraint Satisfaction Based on Subdefinite ModelsDmitry Ushakov. 434-445 [doi]
- Using Constraint Solvers in CAD/CAM SystemsVitaly Telerman. 446-456 [doi]
- A Graphical Interface for Solver CooperationsLaurent Granvilliers, Eric Monfroy. 457-467 [doi]
- Abstract Computability of Non-deterministic Programs over Various Data StructuresNikolaj S. Nikitchenko. 468-481 [doi]
- On Lexicographic Termination Ordering with Space Bound CertificationsGuillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. 482-493 [doi]
- Generalised Computability and Applications to Hybrid SystemsMargarita V. Korovina, Oleg V. Kudinov. 494-499 [doi]
- Exploring Template Template ParametersRoland Weiss, Volker Simonis. 500-510 [doi]
- Compiler-Cooperative Memory Management in JavaVitaly V. Mikheev, Stanislav A. Fedoseev. 511-518 [doi]
- A Software Composition Language and Its ImplementationDietrich Birngruber. 519-529 [doi]
- Editor Definition Language and Its ImplementationAudris Kalnins, Karlis Podnieks, Andris Zarins, Edgars Celms, Janis Barzdins. 530-537 [doi]
- Oberon-2 as Successor of Modula-2 in SimulationAlexey S. Rodionov, Dmitry V. Leskov. 538-546 [doi]