activity
20102023
most citedFormal Verification of Multi-Paxos for Distributed Consensus

43 citations · 157 across the 25 of their papers we have counts for

collaborators

25 papers

cs.PL2023★ 2 cited

Benchmarking for Integrating Logic Rules with Everything Else

Yanhong A. Liu, Scott D. Stoller, Yi Tong +1

Integrating logic rules with other language features is increasingly sought after for advanced applications that require knowledge-base capabilities. To address this demand, increa…

cs.PL2023★ 1 cited

Integrating Logic Rules with Everything Else, Seamlessly

Yanhong A. Liu, Scott D. Stoller, Yi Tong +1

This paper presents a language, Alda, that supports all of logic rules, sets, functions, updates, and objects as seamlessly integrated built-ins. The key idea is to support predica…

cs.DC2023

Specification and Runtime Checking of Derecho, A Protocol for Fast Replication for Cloud Services

Kumar Shivam, Vishnu Paladugu, Yanhong A. Liu

Reliable distributed systems require replication and consensus among distributed processes to tolerate process and communication failures. Understanding and assuring the correctnes…

cs.PL2022

Proceedings of the 2nd Workshop on Logic and Practice of Programming (LPOP)

David S. Warren, Peter Van Roy, Yanhong A. Liu

This proceedings contains abstracts and position papers for the work presented at the second Logic and Practice of Programming (LPOP) Workshop. The workshop was held online, virtua…

cs.PL2022★ 3 cited

Programming with rules and everything else, seamlessly

Yanhong A. Liu, Scott D. Stoller, Yi Tong +2

Logic rules are powerful for expressing complex reasoning and analysis problems. At the same time, they are inconvenient or impossible to use for many other aspects of applications…

cs.LO2021

Proceedings 37th International Conference on Logic Programming (Technical Communications)

Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts +7

ICLP is the premier international event for presenting research in logic programming. Contributions to ICLP 2021 were sought in all areas of logic programming, including but not li…

cs.CY2020★ 7 cited

Discrete Math with Programming: A Principled Approach

Yanhong A. Liu, Matthew Castelllana

Discrete mathematics is the foundation of computer science. It focuses on concepts and reasoning methods that are studied using math notations. It has long been argued that discret…

cs.PL2020★ 2 cited

LPOP: Challenges and Advances in Logic and Practice of Programming

David S. Warren, Yanhong A. Liu

This article describes the work presented at the first Logic and Practice of Programming (LPOP) Workshop, which was held in Oxford, UK, on July 18, 2018, in conjunction with the Fe…

cs.SE2020★ 4 cited

Assurance of Distributed Algorithms and Systems: Runtime Checking of Safety and Liveness

Yanhong A. Liu, Scott D. Stoller

This paper presents a general framework and methods for complete programming and checking of distributed algorithms at a high-level, as in pseudocode languages, but precisely speci…

cs.DB2020★ 5 cited

Recursive Rules with Aggregation: A Simple Unified Semantics

Yanhong A. Liu, Scott D. Stoller

Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications.…

cs.DC2020★ 1 cited

What's Live? Understanding Distributed Consensus

Saksham Chand, Yanhong A Liu

Distributed consensus algorithms such as Paxos have been studied extensively. They all use the same definition of safety. Liveness is especially important in practice despite well-…

cs.LO2019★ 7 cited

Knowledge of Uncertain Worlds: Programming with Logical Constraints

Yanhong A. Liu, Scott D. Stoller

Programming with logic for sophisticated applications must deal with recursion and negation, which together have created significant challenges in logic, leading to many different,…

cs.LO2019★ 3 cited

Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees

K. Tuncay Tekle, Yanhong A. Liu

Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting from the facts or top-down starting from the query. For efficiency, top-do…

cs.CR2019★ 1 cited

Algorithm Diversity for Resilient Systems

Scott D. Stoller, Yanhong A. Liu

Diversity can significantly increase the resilience of systems, by reducing the prevalence of shared vulnerabilities and making vulnerabilities harder to exploit. Work on software…

cs.CR2018★ 5 cited

High-level Cryptographic Abstractions

Christopher Kane, Bo Lin, Saksham Chand +2

The interfaces exposed by commonly used cryptographic libraries are clumsy, complicated, and assume an understanding of cryptographic algorithms. The challenge is to design high-le…

cs.PL2018★ 5 cited

Logic Programming Applications: What Are the Abstractions and Implementations?

Yanhong A. Liu

This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applicati…

cs.DC2018

Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables

Saksham Chand, Yanhong A. Liu

This paper studies specifications and proofs of distributed algorithms when only message history variables are used, using the Basic Paxos and Multi-Paxos algorithms for distribute…

cs.PL2017★ 1 cited

AppLP: A Dialogue on Applications of Logic Programming

David S. Warren, Yanhong A. Liu

This document describes the contributions of the 2016 Applications of Logic Programming Workshop (AppLP), which was held on October 17 and associated with the International Confere…

cs.DC2017★ 8 cited

Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms

Yanhong A. Liu, Saksham Chand, Scott D. Stoller

This paper describes the application of a high-level language and method in developing simpler specifications of more complex variants of the Paxos algorithm for distributed consen…

cs.LO2016★ 12 cited

Founded Semantics and Constraint Semantics of Logic Rules

Yanhong A. Liu, Scott D. Stoller

Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can di…

cs.DC2016★ 43 cited

Formal Verification of Multi-Paxos for Distributed Consensus

Saksham Chand, Yanhong A. Liu, Scott D. Stoller

Paxos is an important algorithm for a set of distributed processes to agree on a single value or a sequence of values, for which it is called Basic Paxos or Multi-Paxos, respective…

cs.PL2015★ 12 cited

Demand-Driven Incremental Object Queries

Yanhong A. Liu, Jon Brandvein, Scott D. Stoller +1

Object queries are essential in information seeking and decision making in vast areas of applications. However, a query may involve complex conditions on objects and sets, which ca…

cs.PL2014★ 28 cited

From Clarity to Efficiency for Distributed Algorithms

Yanhong A. Liu, Scott D. Stoller, Bo Lin

This article describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language…

cs.PF2010★ 7 cited

Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata

Karine Altisen, Yanhong Liu, Matthieu Moy

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order…