Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Manolios, Panagiotis"'
Given a relation and a ranking of its tuples, but no information about the ranking function, we propose RankExplain to solve 2 types of problems: SAT asks if any linear scoring function can exactly reproduce the given ranking. OPT identifies the line
Externí odkaz:
http://arxiv.org/abs/2406.11797
Publikováno v:
EPTCS 393, 2023, pp. 133-150
Teaching proofs is a crucial component of any undergraduate-level program that covers formal reasoning. We have developed a calculational reasoning format and refined it over several years of teaching a freshman-level course, "Logic and Computation",
Externí odkaz:
http://arxiv.org/abs/2311.08860
Autor:
von Hippel, Max, Manolios, Panagiotis, McMillan, Kenneth L., Nita-Rotaru, Cristina, Zuck, Lenore
Publikováno v:
EPTCS 393, 2023, pp. 50-66
When verifying computer systems we sometimes want to study their asymptotic behaviors, i.e., how they behave in the long run. In such cases, we need real analysis, the area of mathematics that deals with limits and the foundations of calculus. In a p
Externí odkaz:
http://arxiv.org/abs/2311.08855
Publikováno v:
EPTCS 393, 2023, pp. 113-132
GossipSub is a popular new peer-to-peer network protocol designed to disseminate messages quickly and efficiently by allowing peers to forward the full content of messages only to a dynamically selected subset of their neighboring peers (mesh neighbo
Externí odkaz:
http://arxiv.org/abs/2311.08859
Publikováno v:
EPTCS 393, 2023, pp. 82-93
Newcomers to ACL2 are sometimes surprised that ACL2 rejects formulas that they believe should be theorems, such as (REVERSE (REVERSE X)) = X. Experienced ACL2 users will recognize that the theorem only holds for intended values of X, and given ACL2's
Externí odkaz:
http://arxiv.org/abs/2311.08857
Teaching college students how to write rigorous proofs is a critical objective in courses that introduce formal reasoning. Over the course of several years, we have developed a mechanically-checkable style of calculational reasoning that we used to t
Externí odkaz:
http://arxiv.org/abs/2307.12224
Publikováno v:
EPTCS 375, 2023, pp. 77-91
Almost all Computer Science programs require students to take a course on the Theory of Computation (ToC) which covers various models of computation such as finite automata, push-down automata and Turing machines. ToC courses tend to give assignments
Externí odkaz:
http://arxiv.org/abs/2303.05867
Publikováno v:
EPTCS 359, 2022, pp. 134-150
ACL2 provides a systems programming capability that allows one to write code that uses and extends ACL2 inside of ACL2. However, for soundness reasons, ACL2 bars the unrestricted use of certain kinds of programming constructs, like destructive update
Externí odkaz:
http://arxiv.org/abs/2205.11704
We describe the design and implementation of a reasoning engine that facilitates the gamification of loop-invariant discovery. Our reasoning engine enables students, computational agents and regular software engineers with no formal methods expertise
Externí odkaz:
http://arxiv.org/abs/2109.01121
Remora is a higher-order, rank-polymorphic array-processing programming language, in the same general class of languages as APL and J. It is intended for writing programs to be executed on parallel hardware. We provide an example-driven introduction
Externí odkaz:
http://arxiv.org/abs/1912.13451