Write a Blog >>
Fri 13 Nov 2020 01:30 - 01:32 at Virtual room 2 - SAT and Synthesis

Specifying and analyzing desired properties of software systems can play an important role in the development of more dependable systems. Alloy is a mature tool-set that provides a first-order, rela- tional logic with transitive closure for writing the specifications, and a fully automatic backend based on propositional satisfiability (SAT) solvers for analyzing them. Alloy’s intuitive notation and sup- port for modern solvers make it a particularly effective specification and analysis tool, which has been applied in several domains, including verification, security, and synthesis. This paper introduces a new backend for Alloy, which complements SAT solvers, and provides a new method to assist Alloy users to more effectively use the tool-set, specifically in scenarios where multiple solutions to the same formula are desired. We add to the Alloy backend support for model counting, i.e., computing the number of solutions to the given formula. We extend the Alloy grammar to add a new com- mand for model counting, and extend the Alloy GUI to customize it. Our implementation, called AlloyMC, supports two state-of-the-art model counters: the approximate model counter ApproxMC and the exact model counter ProjMC. AlloyMC runs on Linux, Mac, and Windows. To use AlloyMC, users just download and run its integrated JAR file with no need to install dependencies (e.g., model counters and their dependent libraries). The AlloyMC source code, the JAR file, and the data set are available publicly.

Fri 13 Nov

Displayed time zone: (UTC) Coordinated Universal Time change

01:30 - 02:00
01:30
2m
Talk
AlloyMC: Alloy Meets Model Counting
Tool Demos
Jiayi Yang University of Texas at Austin, USA, Wenxi Wang University of Texas at Austin, USA, Darko Marinov University of Illinois at Urbana-Champaign, Sarfraz Khurshid University of Texas at Austin
DOI
01:32
2m
Talk
HISyn: Human Learning-Inspired Natural Language Programming
Research Papers
Zifan Nan North Carolina State University, USA, Hui Guan University of Massachusetts at Amherst, USA, Xipeng Shen North Carolina State University, USA
DOI
01:35
1m
Talk
Inductive Program Synthesis over Noisy Data
Research Papers
Shivam Handa Massachusetts Institute of Technology, USA, Martin C. Rinard Massachusetts Institute of Technology, USA
DOI
01:37
1m
Talk
MCBAT: A Practical Tool for Model Counting Constraints on Bounded Integer Arrays
Tool Demos
Abtin Molavi Harvey Mudd College, USA, Mara Downing Harvey Mudd College, USA, Tommy Schneider Harvey Mudd College, USA, Lucas Bang Harvey Mudd College
DOI
01:39
1m
Talk
SVMRanker: A General Termination Analysis Framework of Loop Programs via SVM
Tool Demos
Xie Li , Yi Li Nanyang Technological University, Singapore, Yong Li Institute of Software, Chinese Academy of Sciences, Xuechao Sun Institute of Software at Chinese Academy of Sciences, China, Andrea Turrini State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Lijun Zhang Institute of Software, Chinese Academy of Sciences
DOI
01:41
19m
Talk
Conversations on SAT and Synthesis
Paper Presentations
Abtin Molavi Harvey Mudd College, USA, Jiayi Yang University of Texas at Austin, USA, Lucas Bang Harvey Mudd College, Xie Li , Zifan Nan North Carolina State University, USA, Shivam Handa Massachusetts Institute of Technology, USA, M: Abhik Roychoudhury National University of Singapore, Singapore