Yuri Gurevich

CoRR, 2024

On a measure of intelligence.

[BibT_eX]

[DOI]

CoRR, 2024

On logic and generative AI.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Logical foundations: Personal perspective.

[BibT_eX]

[DOI]

Log. J. IGPL, November, 2023

Software science view on quantum circuit algorithms.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

What are kets?

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Obituary: Gregory Tseytin.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

The umbilical cord of finite model theory.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Obituary: Yuri Manin.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Primal logic of information.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Quantum circuits with classical channels and the principle of deferred measurements.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The 1966 International Congress of Mathematicians: A Micro-memoir.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

Wigner's quasidistribution and Dirac's kets.

[BibT_eX]

[DOI]

Alexander Volberg

Bull. EATCS, 2022

A more abstract bounded exploration postulate.

[BibT_eX]

[DOI]

Tatiana Yavorskaya

CoRR, 2022

2021

Reversify any sequential algorithm.

[BibT_eX]

[DOI]

Bull. EATCS, 2021

Simple circuit simulations of classical and quantum Turing machines.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Braided distributivity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Witness algebra and anyon braiding.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

Means-fit Effectivity.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Circuits: An abstract viewpoint.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Negative probabilities: What they are and what they are for.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Unconstrained Church-Turing thesis cannot possibly be true.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Circuit pedantry.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Test statistics and p-values.

[BibT_eX]

[DOI]

Vladimir Vovk

Proceedings of the Conformal and Probabilistic Prediction and Applications, 2019

2018

An Invitation to Quantum Computing.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Negative probabilities, II What they are and what they are for.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Who needs category theory?

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Evolving Algebras 1993: Lipari Guide.

[BibT_eX]

[DOI]

CoRR, 2018

Coherence for braided distributivity.

[BibT_eX]

[DOI]

CoRR, 2018

2017

On the Rectilinear Steiner Problem.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Common Denominator for Value and Expectation No-go Theorems: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

2016

Basic primal infon logic.

[BibT_eX]

[DOI]

Carlos Cotrini

J. Log. Comput., 2016

Past Present.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Fundamentals of p-values: Introduction.

[BibT_eX]

[DOI]

Mariangiola Dezani-Ciancaglini

Vladimir Vovk

Bull. EATCS, 2016

EATCS Fellows' Advice to the Young Theoretical Computer Scientist.

[BibT_eX]

[DOI]

Luca Aceto

Bull. EATCS, 2016

Inverse privacy.

[BibT_eX]

[DOI]

Jeannette M. Wing

Commun. ACM, 2016

On Quantum Computation, Anyons, and Categories.

[BibT_eX]

[DOI]

Proceedings of the Martin Davis on Computability, 2016

2015

Inverse Privacy.

[BibT_eX]

[DOI]

Efim Hudis

Jeannette M. Wing

CoRR, 2015

Impugning alleged randomness.

[BibT_eX]

[DOI]

Proceedings of the 2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC), 2015

2014

Propositional primal logic with disjunction.

[BibT_eX]

[DOI]

Lev D. Beklemishev

J. Log. Comput., 2014

Primal Infon Logic with Conjunctions as Sets.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

2013

Transitive Primal Infon Logic-ERRATUM.

[BibT_eX]

[DOI]

Carlos Cotrini

Rev. Symb. Log., 2013

Transitive Primal Infon Logic.

[BibT_eX]

[DOI]

Carlos Cotrini

Rev. Symb. Log., 2013

Abstract Hilbertian deductive systems, infon logic, and Datalog.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Explicating SDKs: Uncovering Assumptions Underlying Secure Authentication and Authorization.

[BibT_eX]

[DOI]

Proceedings of the 22th USENIX Security Symposium, Washington, DC, USA, August 14-16, 2013, 2013

dkal ⋆ : Constructing Executable Specifications of Authorization Protocols.

[BibT_eX]

[DOI]

Jean-Baptiste Jeannin

Proceedings of the Engineering Secure Software and Systems - 5th International Symposium, 2013

2012

Impugning Randomness, Convincingly.

[BibT_eX]

[DOI]

Grant Olney Passmore

Stud Logica, 2012

What Is an Algorithm?

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Datalog: A Perspective and the Potential.

[BibT_eX]

[DOI]

Proceedings of the Datalog in Academia and Industry - Second International Workshop, 2012

Foundational Analyses of Computation.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

From Primal Infon Logic with Individual Variables to Datalog.

[BibT_eX]

[DOI]

Nikolaj S. Bjørner

Guido de Caso

Proceedings of the Correct Reasoning, 2012

2011

Logic of infons: The propositional case.

[BibT_eX]

[DOI]

Itay Neeman

ACM Trans. Comput. Log., 2011

Persistent queries in the behavioral theory of algorithms.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

Impugning Randomness, Convincingly.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Zero-One Laws: Thesauri and Parametric Conditions.

[BibT_eX]

[DOI]

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

2010

Content-dependent chunking for differential compression, the local maximum approach.

[BibT_eX]

[DOI]

Nikolaj S. Bjørner

J. Comput. Syst. Sci., 2010

The Tower-of-Babel Problem, and Security Assesment Sharing.

[BibT_eX]

[DOI]

Efim Hudis

Bull. EATCS, 2010

Hilbertian Deductive Systems, Infon Logic, and Datalog.

[BibT_eX]

[DOI]

Bull. EATCS, 2010

Exact Exploration and Hanging Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Evidential Authorization.

[BibT_eX]

[DOI]

Proceedings of the Future of Software Engineering., 2010

2009

Database Query Processing Using Finite Cursor Machines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

A geometric zero-one law.

[BibT_eX]

[DOI]

Robert H. Gilman

Alexei D. Miasnikov

J. Symb. Log., 2009

Symbolic Bounded Model Checking of Abstract State Machines.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2009

Preface.

[BibT_eX]

[DOI]

Bernd Finkbeiner

Alexander K. Petrenko

Proceedings of Fifth Workshop on Model Based Testing, 2009

Teh Logic of Infons.

[BibT_eX]

Itay Neeman

Bull. EATCS, 2009

When are two algorithms the same?

[BibT_eX]

[DOI]

Bull. Symb. Log., 2009

Operational Semantics for DKAL: Application and Analysis.

[BibT_eX]

[DOI]

Arnab Roy

Proceedings of the Trust, 2009

2008

Abstract state machines capture parallel algorithms: Correction and extension.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2008

Program termination and well partial orderings.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2008

Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog.

[BibT_eX]

Bull. EATCS, 2008

Modular difference logic is hard

[BibT_eX]

[DOI]

CoRR, 2008

Persistent Queries

[BibT_eX]

[DOI]

CoRR, 2008

A Natural Axiomatization of Computability and Proof of Church's Thesis.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2008

One Useful Logic That Defines Its Own Truth.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

DKAL: Distributed-Knowledge Authorization Language.

[BibT_eX]

[DOI]

Itay Neeman

Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Why Sets?

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

2007

Ordinary interactive small-step algorithms, III.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2007

Ordinary interactive small-step algorithms, II.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2007

Can abstract state machines be useful in language theory?

[BibT_eX]

[DOI]

Margus Veanes

Charles Wallace

Theor. Comput. Sci., 2007

Membership Problem for the Modular Group.

[BibT_eX]

[DOI]

Paul E. Schupp

SIAM J. Comput., 2007

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Interactive Small-Step Algorithms I: Axiomatization.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Background of Computation.

[BibT_eX]

Bull. EATCS, 2007

Zero-One Laws: Thesauri and Parametric Conditions.

[BibT_eX]

Bull. EATCS, 2007

A Theory of Stream Queries.

[BibT_eX]

[DOI]

Dirk Leinders

Jan Van den Bussche

Proceedings of the Database Programming Languages, 11th International Symposium, 2007

Proving Church's Thesis.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2007

2006

Ordinary interactive small-step algorithms, I.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2006

Can Abstract State Machines Be Useful in Language Theory?.

[BibT_eX]

[DOI]

Charles Wallace

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Partial updates.

[BibT_eX]

[DOI]

Nikolai Tillmann

Theor. Comput. Sci., 2005

Semantic essence of AsmL.

[BibT_eX]

[DOI]

Benjamin Rossman

Wolfram Schulte

Theor. Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Proceedings of the Fifth Workshop on Runtime Verification, 2005

Interactive Algorithms 2005.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Play to Test.

[BibT_eX]

[DOI]

Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005

Behavioral Computation Theory 2005.

[BibT_eX]

[DOI]

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

2004

Abstract Communication Model for Distributed Systems.

[BibT_eX]

[DOI]

Uwe Glässer

Margus Veanes

IEEE Trans. Software Eng., 2004

Preface.

[BibT_eX]

[DOI]

Alexander K. Petrenko

Alexander S. Kossatchev

Proceedings of the Workshop on Model Based Testing, 2004

Why Sets? (Column: Logic in Computer Science).

[BibT_eX]

Bull. EATCS, 2004

Abstract State Machines: An Overview of the Project.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2004

Observations on the Decidability of Transitions.

[BibT_eX]

[DOI]

Rostislav Yavorskiy

Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

Intra-step Interaction.

[BibT_eX]

[DOI]

Proceedings of the Abstract State Machines 2004. Advances in Theory and Practice, 2004

2003

Abstract state machines capture parallel algorithms.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2003

Strong extension axioms and Shelah's zero-one law for choiceless polynomial time.

[BibT_eX]

[DOI]

J. Symb. Log., 2003

Algorithms: A Quest for Absolute Definitions.

[BibT_eX]

Bull. EATCS, 2003

Spectra of Monadic Second-Order Formulas with One Unary Function.

[BibT_eX]

[DOI]

Saharon Shelah

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Partial Updates Exploration II.

[BibT_eX]

[DOI]

Nikolai Tillmann

Proceedings of the Abstract State Machines, 2003

2002

Definability in Rationals with Real Order in the Background.

[BibT_eX]

[DOI]

Alexander Moshe Rabinovich

J. Log. Comput., 2002

On Polynomial Time Computation over Unordered Structures.

[BibT_eX]

[DOI]

Saharon Shelah

J. Symb. Log., 2002

Abstract State Machines and Computationally Complete Query Languages.

[BibT_eX]

[DOI]

Jan Van den Bussche

Inf. Comput., 2002

Algorithms vs. Machines.

[BibT_eX]

Bull. EATCS, 2002

Pairwise Testing.

[BibT_eX]

Bull. EATCS, 2002

Fixed point logics.

[BibT_eX]

[DOI]

Anuj Dawar

Bull. Symb. Log., 2002

Generating finite state machines from abstract state machines.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Software Testing and Analysis, 2002

High-Level Executable Specification of the Universal Plug and Play Architecture.

[BibT_eX]

[DOI]

Uwe Glässer

Margus Veanes

Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

2001

Inadequacy of computable loop invariants.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2001

Partial Updates: Exploration.

[BibT_eX]

[DOI]

Nikolai Tillmann

J. Univers. Comput. Sci., 2001

Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187.

[BibT_eX]

[DOI]

Saharon Shelah

Ann. Pure Appl. Log., 2001

Logician in the Land of OS: Abstract State Machines in Microsoft.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

The Abstract State Machine Paradigm: What Is in and What Is out.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2001

The Sequential ASM Thesis.

[BibT_eX]