All Stories

  1. Tools and Software at the Systems and Software Product Line Conference (SPLC 2022 and 2023)
  2. Deltas for Functional Programs with Algebraic Data Types
  3. Variability modules
  4. FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC
  5. On logical and extensional characterizations of attributed feature models
  6. Efficient static analysis and verification of featured transition systems
  7. Static analysis and family-based model checking with VMC
  8. Variability modules for Java-like languages
  9. Static analysis and family-based model checking of featured transition systems with VMC
  10. Splitting Recursion Schemes into Reversible and Classical Interacting Threads
  11. On the Expressivity of Total Reversible Programming Languages
  12. On Slicing Software Product Line Signatures
  13. On Two Characterizations of Feature Models
  14. A class of Recursive Permutations which is Primitive Recursive complete
  15. The fixed point problem of a simple reversible language
  16. Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form
  17. Quantum Programming Made Easy
  18. QPCF: Higher-Order Languages and Quantum Circuits
  19. A formal model for Multi Software Product Lines
  20. On the expressiveness of modal transition systems with variability constraints
  21. Static analysis of featured transition systems
  22. Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints
  23. On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions
  24. Multi Software Product Lines in the Wild
  25. Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
  26. A Formal Model for Multi SPLs
  27. $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
  28. A Class of Reversible Primitive Recursive Functions
  29. Essential and relational models
  30. From Featured Transition Systems to Modal Transition Systems with Variability Constraints
  31. On the reification of semantic linearity
  32. Proceedings Sixth Workshop on Intersection Types and Related Systems
  33. Call-by-Value Solvability, Revisited
  34. Preface
  35. Linearity and PCF
  36. Linearity and PCF: a semantic insight!
  37. Strong normalization from an unusual point of view
  38. Logical Semantics for Stability
  39. A Process-Model for Linear Programs
  40. Semantically linear programming languages
  41. Parametric λ -theories
  42. A stable programming language
  43. An Operational Characterization of Strong Normalization
  44. Lazy Strong Normalization
  45. Lazy Logical Semantics
  46. Parametric parameter passing λ-calculus
  47. Further Reading
  48. Further Reading
  49. Representing Functions
  50. Further Reading
  51. Preliminaries
  52. Parametric Operational Semantics
  53. Operational Extensionality
  54. λΔ-Models
  55. The Parametric Lambda Calculus
  56. The Parametric λ-Calculus
  57. Filter λΔ-Models and Domains
  58. Call-by-Name Operational Semantics
  59. Call-by-Value Denotational Semantics
  60. The Call-by-Value λ-Calculus
  61. The Call-by-Name λ-Calculus
  62. Call-by-Value Operational Semantics
  63. Call-by-Name Denotational Semantics
  64. Call-by-Value Separability and Computability
  65. Call-by-value Solvability