Logic in Computer Science · arXiv:2611.16815 v1 · submitted 12 Nov 2026 · 27 references
Selective Chaining of Parameterised Boolean Equation Systems
The paper says
“Parameterised Boolean Equations Systems (PBESs) are used to verify properties of formal industrial models.”
more of the abstract
We introduce a technique called selective chaining to simplify these PBESs by unfolding specific predicate variable instances when the unfolding results in a PBES that is likely to be simpler. For determining the latter we propose a set of heuristics. We show the formal correctness of the chaining operator and provide theoretical upper bounds using relevancy graphs on the size of the verification problem after chaining. Lastly, we study the effectiveness of our heuristics, showing that selective chaining can reduce memory usage and yield significant speed-ups solving PBESs that encode model checking problems for complex industrial systems.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. Solid incremental technique for PBES simplification; soundness proof is clean, but the empirical case for the heuristics rests heavily on two confidential case studies. This line is wrong
3 major objections · 8 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 27 references say.
The paper says, at §5.1, §5.3
The review did not quote this passage.
Pith says: Objection 1 of 3 · major
Two of the three case studies (C-2 Maeslant Barrier, C-3 Pneumatic Cylinder) are confidential, with model details omitted. The paper's central empirical claim—up to 25× speedup and 14× memory reduction—rests heavily on these confidential cases. While the authors acknowledge this indirectly by omitting details, the lack of a public, reproducible benchmark is a load-bearing concern for the claimed practical benefits.
more of objection 1
The heuristics (H1–H4) are empirically tuned, and their effectiveness is demonstrated only on these three cases. Without independent verification on a shared benchmark, the reported improvements could be artifacts of the specific (confidential) models or solver configuration. The paper's own Section 6 notes that the order of chaining remains unexplored and can change the final PBES, further underscoring that the heuristics are not yet robustly understood. The soundness proof (Theorem 3.11) is not in question; the concern is about the empirical support for the claimed practical benefits.
The paper says, at §5.2, Figure 2b
The review did not quote this passage.
Pith says: Objection 2 of 3 · major
The evaluation of heuristic H2 (Bounded PVI expansion) for C-1 shows that higher bounds (e.g., 50) can lead to faster solving times for the hardest properties, but also increase pbeschain running time, sometimes making the total time worse than not chaining at all.
more of objection 2
The paper acknowledges a tipping point but does not provide a systematic way to choose the bound. This is a limitation, but it is stated. However, the claim that 'the number of nodes in the relevancy graph is consistently 7-10x lower when the maximum number of PVI increases' (line after [b251]) is not supported by a quantitative comparison in the text; only a qualitative statement is given. The paper should provide concrete numbers or a table to substantiate this claim.
The paper says, at §3.2, Theorem 3.15
The review did not quote this passage.
Pith says: Objection 3 of 3 · major
Theorem 3.15 states that for PBESs in SRF, the relevancy graph after chaining has edges only in E_G ∪ eE_{G,X,i}, and no new vertices are introduced. This is a useful bound. However, the proof relies on Lemma 3.14, which assumes that (Y,w) is not in (X,v)• and that (X, Jarg_i(φ_X)Kδ[v/d_X]) ∈ (X,v)• implies (Y,w) ∉ (X, Jarg_i(φ_X)Kδ[v/d_X])• for all δ.
more of objection 3
The lemma's statement is conditional on these assumptions, and the proof of Theorem 3.15 uses Lemma 3.14 to handle the case where ( (Z,v),(Y,w) ) ∉ E_G. The reasoning appears sound, but the presentation could be clearer: the proof of Theorem 3.15 is very brief (only a few lines) and relies heavily on Lemma 3.14 without explicitly showing how the conditions of Lemma 3.14 are satisfied. Expanding the proof would improve readability.
8 minor objections
The paper says, at §1, Example
Pith says: minor objection 1 of 8
The example unfolding in the introduction shows the formula after unfolding but does not explicitly state that the resulting equation is more complex. It would be helpful to note that the number of PVIs increases from 2 to 4, illustrating the blow-up.
The paper says, at §3.1, Definition 3.5
Pith says: minor objection 2 of 8
The definition of chain_I(φ_X) uses φ_X⟨arg_i(φ_X)⟩, but it is not immediately clear that this is the right-hand side with the formal parameter d replaced by the actual argument. The notation φ_X⟨e⟩ is defined earlier (after Definition 2.1) as φ_X[(d_1,...,d_n) := (e_1,...,e_n)], but a brief reminder here would aid readability.
show 6 more
The paper says, at §4, Algorithm 1
Pith says: minor objection 3 of 8
The algorithm uses 'pick' without specifying the selection strategy. The paper later (Section 6) notes that the order of chaining is unexplored. It would be helpful to state explicitly that the current implementation uses an arbitrary order (e.g., the order in which PVIs appear in the formula).
The paper says, at §5.1, Table 1
Pith says: minor objection 4 of 8
Table 1 lists memory limits for each property of C-1. It would be useful to also report the actual memory usage (peak resident set size) for the base and chained cases, as is done for C-2 in Figure 4a. The memory comparison for C-1 in Figure 4b uses log-log scale and shows a clear reduction, but the text does not discuss the absolute values.
The paper says, at §5.2, H3 discussion
Pith says: minor objection 5 of 8
The sentence 'We can notice this here since this case study generally contains more complex data expressions' is vague. It would be better to provide a concrete example or quantify the complexity (e.g., size of data expressions).
The paper says, at §5.3, General trends
Pith says: minor objection 6 of 8
The claim 'there is never an increase in relevant nodes after chaining' (based on Theorem 3.15) is stated as empirically confirmed. However, Theorem 3.15 only guarantees no new vertices for SRF PBESs; the paper should clarify whether all case study PBESs are in SRF after preprocessing. The text mentions that SRF transformation is applied for symbolic cases (H3), but for explicit cases (C-3) it is not mentioned. Please clarify.
The paper says, at Appendix B
Pith says: minor objection 7 of 8
The benchmark commands include options like '--cached-rjittyc' and '--groups=used' that are not explained. A brief explanation of these options would help reproducibility.
The paper says, at References
Pith says: minor objection 8 of 8
Reference [Str25] is a PhD thesis (Stramaglia, 2025). The paper cites it for Lemma A.2, but the lemma is standard (substitution lemma). It would be acceptable to provide a self-contained proof or cite a more accessible source.
What would settle it
Release the models and properties for C-2 and C-3 (or sufficiently detailed anonymized versions) and run the same pbeschain pipeline on a public benchmark, e.g., the mCRL2 example suite or the BEEM benchmark. If the speedup and memory reduction patterns replicate on at least three public models of comparable complexity, the concern is resolved.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up, with conditions
- Skeptic agrees
- Editor wrote the verdict above
- Referee major revision: 3 major objections, 8 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
Jore,
This paper introduces selective chaining for PBESs—unfolding only specific predicate variable instances instead of all occurrences—and backs it with a soundness proof and a set of heuristics to avoid blow-up. The core idea is sensible and the formal work is the real contribution: Theorem 3.11 (soundness) and Theorem 3.15 (bounds on relevancy graph size for SRF PBESs) are cleanly proved and give the technique a solid foundation. The paper also ships an implementation in the mCRL2 toolset, which is good practice.
The soft spot is the empirical evaluation. The paper reports up to 25× speedup and 14× memory reduction, but two of the three case studies (Maeslant Barrier, Pneumatic Cylinder) are confidential. Only the Prinses Marijke lock complex is public. For a technique whose effectiveness depends on four heuristics (H1–H4) that are empirically tuned and whose interaction with PBES structure is not formally characterized, this is a real limitation. The authors acknowledge that the order of chaining is unexplored and can change the final PBES (Section 6), which further underscores that the heuristics are not yet robustly understood. The soundness proof is not in question; the concern is about the empirical support for the claimed practical benefits. The paper would be stronger with a public benchmark and a more systematic sensitivity analysis of the heuristic parameters.
Who is this for? Researchers working on PBES-based verification and practitioners using mCRL2 who hit state explosion. The paper deserves a serious referee—the formal contributions are real and the technique is useful—but the referee should push for better empirical transparency.
I'd bring it to a reading group focused on formal verification techniques, but I'd note the reproducibility caveat. I wouldn't cite it for the empirical claims without independent verification, but I might cite it for the soundness proof and the chaining operator definition.
Recommendation: accept with major revision requiring either (a) making at least one more case study public, or (b) adding a synthetic benchmark suite that allows independent reproduction of the main trends.
The strongest objection
The paper's central claim—that selective chaining yields up to 25× speedup and 14× memory reduction—is supported by three case studies, but two of them (C-2 Maeslant Barrier, C-3 Pneumatic Cylinder) are confidential. Only C-1 (Prinses Marijke lock complex) is public. The authors acknowledge this indirectly by omitting model details for C-2 and C-3. For a technique whose effectiveness depends on heuristics (H1–H4) that are empirically tuned and whose interaction with PBES structure is not formally characterized, the lack of a public, reproducible benchmark is a load-bearing concern. Without independent verification on a shared benchmark, the reported improvements could be artifacts of the specific (confidential) models or of the particular solver configuration used. The paper's own Section 6 notes that the order of chaining remains unexplored and can change the final PBES, further underscoring that the heuristics are not yet robustly understood. The soundness proof (Theorem 3.11) is not in question; the concern is about the empirical support for the claimed practical benefits.
The reader's verdict is CONDITIONAL, citing reliance on confidential case studies and lack of reproducibility. My stress-test identifies the same weakest point: the empirical validation is not independently verifiable. The reader's weakest_assumption (heuristics may not generalize) is exactly the concern I articulate. I do not downgrade the verdict because the paper's theoretical contributions (soundness, upper bounds) are solid and the authors are transparent about limitations. However, I emphasize that the central claim of practical effectiveness cannot be fully assessed without public benchmarks. The concrete test I propose is feasible and would directly address the reproducibility gap. I agree with the reader that the verdict should remain CONDITIONAL until broader validation is provided.
The referee's report
If the results hold, selective chaining offers a useful addition to the toolbox for mitigating state explosion in model checking via PBESs. The soundness proof is rigorous, and the theoretical bounds for SRF PBESs are a solid contribution. The heuristics are plausible and the experimental results, though limited in public reproducibility, show consistent improvements across the tested cases. The technique is complementary to existing static analysis methods for PBESs.
Pith's reading of the paper (a machine's summary, not the authors')
Parameterised Boolean Equation Systems (PBESs) encode model checking problems as sequences of fixpoint equations, and solving them can trigger the state explosion problem. This paper introduces selective chaining, a transformation that unfolds only chosen predicate variable instances when doing so is likely to simplify the system, rather than applying the rolling rule of fixpoint theory to everything at once. The paper proves chaining is sound — it preserves the solution of the original PBES — and bounds how much the search space can grow, for systems in standard recursive form. Four heuristics decide which instances to chain, and on three real-world industrial control models, chained PBESs solve up to 25x faster and use up to 14x less memory. The claim is that these heuristics capture most of the benefit while keeping the adverse blow-ups of wholesale unfolding under control.
What carries the argument. The chaining operator $\mathrm{chain}_I(\varphi_X)$ is the central mechanism: given the right-hand side of the equation for $X$, it replaces every selected predicate variable instance $X(\arg_i(\varphi_X))$ in the set $I$ with $\varphi_X\langle\arg_i(\varphi_X)\rangle$, the right-hand side instantiated at those arguments. This is a local refinement of the rolling rule $\sigma(f \circ g) = f(\sigma(g \circ f))$ of fixpoint theory, which unfolds all occurrences at once and can blow the system up. Soundness is established by extending a proof graph with shortcut edges — the extended graph $G_{X,i}$ — and showing the result is still a proof graph, so any certificate transfers to the chained system. Four heuristics govern which instances get chained: avoiding quantifier-scoped predicate variable instances, bounding the number of new instances per chaining action, converting to standard recursive form before chaining when the solver requires it, and capping the unfolded formula's size.
Core claim. The central claim is that chaining — replacing selected occurrences of a predicate variable instance $X(\arg_i(\varphi_X))$ with the instantiated right-hand side $\varphi_X\langle\arg_i(\varphi_X)\rangle$ — preserves the solution of the PBES (Theorem 3.11), and that for PBESs in standard recursive form, the relevancy graph of the chained system introduces no new vertices, only edges between existing ones (Theorem 3.15). Because the proof works by extending a proof graph with shortcut edges and checking that infinite paths remain $\nu$-dominated, the certificate of a solution survives chaining, so a model checker's conclusion is unchanged. The empirical claim is that, on two symbolic and one explicit solver configuration over three control-heavy industrial models, chaining with the proposed heuristics delivers up to 25x shorter solve times and up to 14x lower memory, with the largest absolute gains on the hardest requirements.
The premise it rests on. The load-bearing premise is that the four heuristics reliably pick chaining steps that simplify rather than enlarge the solving problem; the paper demonstrates this on only three industrial case studies, two of them confidential, and acknowledges that the order of chaining — which can change the final PBES — remains unexplored.
If the paper is right (Pith's inferences, not the authors')
For PBESs in standard recursive form, chaining adds no new predicate variable instances to the relevancy graph — only edges among already-relevant instances — so any blow-up is bounded by the original graph's vertex count.
Because chaining preserves the solution, it can be applied as a preprocessing step without changing what the model checker concludes, only how fast and with how much memory it reaches that conclusion.
Allowing more new predicate variable instances per chaining action shrinks the relevancy graph 7–10x even while it increases the syntactic PVI count, and the best bound shifts with the size of the requirement being solved.
Converting to standard recursive form before chaining can dominate the benefit in some cases: one requirement solved in 10 minutes when the conversion preceded chaining but took 28 hours without it.
Because the authors report little benefit on models with substantial parallelism, an inference is that chaining targets control-heavy sequential behaviour; a natural extension is ordering chaining by dependency depth or chain length instead of the current arbitrary pick order.
The sliding optimum of the PVI-expansion bound across solving regimes suggests an adaptive policy that tunes the bound to the expected requirement size could outperform any fixed setting, a testable extension the paper does not pursue.
Since chaining is sound on general PBESs but only bounded in standard recursive form, a conservative practical rule — convert to standard recursive form first, then chain — accepts the small overheads seen in the Maeslant case while buying the tightest size guarantee.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Parameterised Boolean Equations Systems (PBESs) are used to verify properties of formal industrial models. We introduce a technique called selective chaining to simplify these PBESs by unfolding specific predicate variable instances when the unfolding results in a PBES that is likely to be simpler. For determining the latter we propose a set of heuristics. We show the formal correctness of the chaining operator and provide theoretical upper bounds using relevancy graphs on the size of the verification problem after chaining. Lastly, we study the effectiveness of our heuristics, showing that selective chaining can reduce memory usage and yield significant speed-ups solving PBESs that encode model checking problems for complex industrial systems.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 1.00
“Lastly, we study the effectiveness of our heuristics, showing that selective chaining can reduce memory usage and yield significant speed-ups solving PBESs that encode model checking problems for complex industrial systems.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.13 · human participants 0.02 · controlled comparison 0.09 · randomized assignment 0.01 · states quantitative result 0.44 · compares with prior results 0.15 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Parameterised Boolean Equations Systems (PBESs) are used to verify properties of formal industrial models. | background 1.00 | 0.05 | 0.03 | asserted 1.00 |
| We introduce a technique called selective chaining to simplify these PBESs by unfolding specific predicate variable instances when the unfolding results in a PBES that is likely to be simpler. | contribution 0.79 | 0.94 | 0.13 | asserted 0.88 |
| For determining the latter we propose a set of heuristics. | method 0.80 | 0.88 | 0.03 | asserted 0.97 |
| We show the formal correctness of the chaining operator and provide theoretical upper bounds using relevancy graphs on the size of the verification problem after chaining. | contribution 0.85 | 0.96 | 0.10 | asserted 1.00 |
| Lastly, we study the effectiveness of our heuristics, showing that selective chaining can reduce memory usage and yield significant speed-ups solving PBESs that encode model checking problems for complex industrial systems. | result 0.95 | 0.96 | 0.76 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 0.48
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 4,217 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (4)
Figures are the authors', reproduced from the paper.
References (27)
- [1] Groote, Jan Friso and Willemse, Tim A. C. Parameterised boolean equation systems. Theor. Comput. Sci. 2005. doi:10.1016/J.TCS.2005.06.016 on Pithdoi:10.1016/j.tcs.2005.06.016
- [2] Neele, Thomas and van de Pol, Jaco. Operations on Fixpoint Equation Systems. Log. Methods Comput. Sci. 2024. doi:10.46298/LMCS-20(3:5)2024 on Pithdoi:10.46298/lmcs-20(3:5)2024
- [3] Ploeger, Bas and Wesselink, Wieger and Willemse, Tim A. C. Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems. Inf. Comput. 2011. doi:10.1016/J.IC.2010.11.025 on Pithdoi:10.1016/j.ic.2010.11.025
- [4] Koolen, Ruud P. J. and Willemse, Tim A. C. and Zantema, Hans. Using SMT for Solving Fragments of Parameterised Boolean Equation Systems. ATVA. 2015. doi:10.1007/978-3-319-24953-7\_3 on Pithdoi:10.1007/978-3-319-24953-7
- [5] Cranen, Sjoerd and Luttik, Bas and Willemse, Tim A. C. Proof Graphs for Parameterised Boolean Equation Systems. CONCUR. 2013. doi:10.1007/978-3-642-40184-8\_33 on Pithdoi:10.1007/978-3-642-40184-8
- [6] Mader, Angelika. Verification of modal properties using Boolean equation systems. 1997 on Pith
- [7] Bunte, Olav and Groote, Jan Friso and Keiren, Jeroen J. A. and Laveaux, Maurice and Neele, Thomas and de Vink, Erik P. and Wesselink, Wieger and Wijs, Anton and Willemse, Tim A. C. The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability.... on Pithdoi:10.1007/978-3-030-17465-1
- [8] Beers, Adrian and Booy, Jore and Groote, Jan Friso and van den Bogaard, Johan and Bouwman, Mark. A Complete Formal Specification and Verification of the BESW Software Control System of the Maeslant Storm Surge Barrier. FMICS. 2025. doi:10.1007/978-3-032-00942-5\_12 on Pithdoi:10.1007/978-3-032-00942-5
- [9] Hwong, Yi - Ling and Keiren, Jeroen J. A. and Kusters, Vincent J. J. and Leemans, Sander J. J. and Willemse, Tim A. C. Formalising and analysing the control software of the Compact Muon Solenoid Experiment at the Large Hadron Collider. Sci. Comput. Program. 2013. doi:10.1016/J... on Pithdoi:10.1016/j.scico.2012.11.009
- [10] Orzan, Simona and Wesselink, Wieger and Willemse, Tim A. C. Static Analysis Techniques for Parameterised Boolean Equation Systems. TACAS. 2009. doi:10.1007/978-3-642-00768-2\_22 on Pithdoi:10.1007/978-3-642-00768-2
- [11] Keiren, Jeroen J. A. and Wesselink, Wieger and Willemse, Tim A. C. Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction. CoRR. 2013 on Pith
- [12] Clarke, Edmund M. and Biere, Armin and Raimi, Richard and Zhu, Yunshan. Bounded Model Checking Using Satisfiability Solving. Formal Methods Syst. Des. 2001. doi:10.1023/A:1011276507260 on Pithdoi:10.1023/a:1011276507260
- [13] Groote, Jan Friso and Volk, Matthias. A formal specification of the desired software behaviour of the Princess Marijke lock complex. CoRR. 2025. doi:10.48550/ARXIV.2507.02721 on PithPith's reviewarXivdoi:10.48550/arxiv.2507.02721
- [14] Orzan, Simona and Willemse, Tim A. C. Invariants for Parameterised Boolean Equation Systems. Theor. Comput. Sci. 2010. doi:10.1016/J.TCS.2009.11.001 on Pithdoi:10.1016/j.tcs.2009.11.001
- [15] van de Pol, Jaco and Timmer, Mark. State Space Reduction of Linear Processes Using Control Flow Reconstruction. ATVA. 2009. doi:10.1007/978-3-642-04761-9\_5 on Pithdoi:10.1007/978-3-642-04761-9
- [16] Kobayashi, Naoki and Fedyukovich, Grigory and Gupta, Aarti. Fold/Unfold Transformations for Fixpoint Logic. TACAS (2). 2020. doi:10.1007/978-3-030-45237-7\_12 on Pithdoi:10.1007/978-3-030-45237-7
- [17] van Dortmont, Danny and Keiren, Jeroen J. A. and Willemse, Tim A. C. Modelling and Analysing a Mechanical Lung Ventilator in mCRL2. ABZ. 2024. doi:10.1007/978-3-031-63790-2\_27 on Pithdoi:10.1007/978-3-031-63790-2
- [18] Stramaglia, Anna and Keiren, Jeroen J. A. Formal Verification of an Industrial UML-like Model using mCRL2. FMICS. 2022. doi:10.1007/978-3-031-15008-1\_7 on Pithdoi:10.1007/978-3-031-15008-1
- [19] Remenska, Daniela and Willemse, Tim A. C. and Verstoep, Kees and Templon, Jeff and Bal, Henri E. Using model checking to analyze the system behavior of the LHC production grid. Future Gener. Comput. Syst. 2013 on Pith
- [20] Bartholomeus, Maarten and Luttik, Bas and Willemse, Tim A. C. Modelling and Analysing ERTMS Hybrid Level 3 with the mCRL2 Toolset. FMICS. 2018. doi:10.1007/978-3-030-00244-2\_7 on Pithdoi:10.1007/978-3-030-00244-2
show 7 more
- [21] Zielonka, Wieslaw. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theor. Comput. Sci. 1998. doi:https://doi.org/10.1016/S0304-3975(98)00009-7 on Pithdoi:10.1016/s0304-3975(98)00009-7
- [22] Liem, Edward. Extraction of Invariants in Parameterised Boolean Equation Systems. 2023 on Pith
- [23] Steffen, Bernhard and Cla en, Andreas and Klein, Marion and Knoop, Jens and Margaria, Tiziana. The Fixpoint-Analysis Machine. CONCUR. 1995. doi:10.1007/3-540-60218-6\_6 on Pithdoi:10.1007/3-540-60218-6
- [24] Stramaglia, Anna. Model Checking Machine-Control Applications. 2025 on Pith
- [25] Laveaux, Maurice and Wesselink, Wieger and Willemse, Tim A. C. On-The-Fly Solving for Symbolic Parity Games. TACAS (2). 2022. doi:10.1007/978-3-030-99527-0\_8 on Pithdoi:10.1007/978-3-030-99527-0
- [26] Neele, Thomas. (Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems. Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated R... on Pith
- [27] Lamport, Leslie. Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. 2002 on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment