On the Complexity of ATL and ATL* Module Checking

Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment. Classically, module checking has been investigated with respect to specifications given as CTL and CTL* formulas. Recently, it has been shown that CTL (resp., CTL*) module checking offers a distinctly different perspective from the better-known problem of ATL (resp., ATL*) model checking. In particular, ATL (resp., ATL*) module checking strictly enhances the expressiveness of both CTL (resp., CTL*) module checking and ATL (resp. ATL*) model checking. In this paper, we provide asymptotically optimal bounds on the computational cost of module checking against ATL and ATL*, whose upper bounds are based on an automata-theoretic approach. We show that module-checking for ATL is EXPTIME-complete, which is the same complexity of module checking against CTL. On the other hand, ATL* module checking turns out to be 3EXPTIME-complete, hence exponentially harder than CTL* module checking.Comment: In Proceedings GandALF 2017, arXiv:1709.0176

In the Age of Web: Typed Functional-First Programming Revisited

Most programming languages were designed before the age of web. This matters because the web changes many assumptions that typed functional language designers take for granted. For example, programs do not run in a closed world, but must instead interact with (changing and likely unreliable) services and data sources, communication is often asynchronous or event-driven, and programs need to interoperate with untyped environments. In this paper, we present how the F# language and libraries face the challenges posed by the web. Technically, this comprises using type providers for integration with external information sources and for integration with untyped programming environments, using lightweight meta-programming for targeting JavaScript and computation expressions for writing asynchronous code. In this inquiry, the holistic perspective is more important than each of the features in isolation. We use a practical case study as a starting point and look at how F# language and libraries approach the challenges posed by the web. The specific lessons learned are perhaps less interesting than our attempt to uncover hidden assumptions that no longer hold in the age of web.Comment: In Proceedings ML/OCaml 2014, arXiv:1512.0143

Exploiting Term Hiding to Reduce Run-time Checking Overhead

One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the correctness of these operations. A solution is adding run-time checks to the program via assertions, but this can introduce overheads that are in many cases impractical. While static analysis can greatly reduce such overheads, the gains depend strongly on the quality of the information inferred. Reusable libraries, i.e., library modules that are pre-compiled independently of the client, pose special challenges in this context. We propose a technique which takes advantage of module systems which can hide a selected set of functor symbols to significantly enrich the shape information that can be inferred for reusable libraries, as well as an improved run-time checking approach that leverages the proposed mechanisms to achieve large reductions in overhead, closer to those of static languages, even in the reusable-library context. While the approach is general and system-independent, we present it for concreteness in the context of the Ciao assertion language and combined static/dynamic checking framework. Our method maintains the full expressiveness of the assertion language in this context. In contrast to other approaches it does not introduce the need to switch the language to a (static) type system, which is known to change the semantics in languages like Prolog. We also study the approach experimentally and evaluate the overhead reduction achieved in the run-time checks.Comment: 26 pages, 10 figures, 2 tables; an extension of the paper version accepted to PADL'18 (includes proofs, extra figures and examples omitted due to space reasons

Airy, Beltrami, Maxwell, Morera, Einstein and Lanczos potentials revisited

The main purpose of this paper is to revisit the well known potentials, called stress functions, needed in order to study the parametrizations of the stress equations, respectively provided by G.B. Airy (1863) for 2-dimensional elasticity, then by E. Beltrami (1892), J.C. Maxwell (1870) and G. Morera (1892) for 3-dimensional elasticity, finally by A. Einstein (1915) for 4-dimensional elasticity, both with a variational procedure introduced by C. Lanczos (1949,1962) in order to relate potentials to Lagrange multipliers. Using the methods of Algebraic Analysis, namely mixing differential geometry with homological algebra and combining the double duality test involved with the Spencer cohomology, we shall be able to extend these results to an arbitrary situation with an arbitrary dimension n. We shall also explain why double duality is perfectly adapted to variational calculus with differential constraints as a way to eliminate the corresponding Lagrange multipliers. For example, the canonical parametrization of the stress equations is just described by the formal adjoint of the n2(n2 -- 1)/12 components of the linearized Riemann tensor considered as a linear second order differential operator but the minimum number of potentials needed in elasticity theory is equal to n(n -- 1)/2 for any minimal parametrization. Meanwhile, we can provide all the above results without even using indices for writing down explicit formulas in the way it is done in any textbook today. The example of relativistic continuum mechanics with n = 4 is provided in order to prove that it could be strictly impossible to obtain such results without using the above methods. We also revisit the possibility (Maxwell equations of electromag- netism) or the impossibility (Einstein equations of gravitation) to obtain canonical or minimal parametrizations for various other equations of physics. It is nevertheless important to notice that, when n and the algorithms presented are known, most of the calculations can be achieved by using computers for the corresponding symbolic computations. Finally, though the paper is mathematically oriented as it aims providing new insights towards the mathematical foundations of elasticity theory and mathematical physics, it is written in a rather self-contained way

New results on pushdown module checking with imperfect information

Model checking of open pushdown systems (OPD) w.r.t. standard branching temporal logics (pushdown module checking or PMC) has been recently investigated in the literature, both in the context of environments with perfect and imperfect information about the system (in the last case, the environment has only a partial view of the system's control states and stack content). For standard CTL, PMC with imperfect information is known to be undecidable. If the stack content is assumed to be visible, then the problem is decidable and 2EXPTIME-complete (matching the complexity of PMC with perfect information against CTL). The decidability status of PMC with imperfect information against CTL restricted to the case where the depth of the stack content is visible is open. In this paper, we show that with this restriction, PMC with imperfect information against CTL remains undecidable. On the other hand, we individuate an interesting subclass of OPDS with visible stack content depth such that PMC with imperfect information against the existential fragment of CTL is decidable and in 2EXPTIME. Moreover, we show that the program complexity of PMC with imperfect information and visible stack content against CTL is 2EXPTIME-complete (hence, exponentially harder than the program complexity of PMC with perfect information, which is known to be EXPTIME-complete).Comment: In Proceedings GandALF 2011, arXiv:1106.081

Teaching and learning of performance measurement in OR/MS degrees

A review of existing UK MS/OR undergraduate programmes was completed to assess the extent and nature of performance measurement teaching. In addition, a survey of performance measurement practitioners was undertaken to obtain views on what should be taught in relation to performance measurement. A survey of 23 undergraduate MS/OR degrees in the UK revealed that all the academic respondents supported the inclusion of PM teaching. However, only four distinct PM classes could be found amongst these degrees. The PM techniques taught were broadly similar although the wider context of PM was taught in only 2 of the classes. A survey of a small number of PM practitioners revealed that the Balanced Scorecard and Benchmarking were the two most commonly applied PM techniques with the majority of respondents learning about PM from personal experience and reading rather than through formal education. It appears that there is an opportunity for MS/OR teaching to make a major contribution to the development of PM as a discipline. However, academic respondents whose MS/OR degree course did not teach PM indicated that lack of staff expertise in PM combined with an already full syllabus were the main barriers to introducing a PM class