"Finite satisfiability of class diagrams: practical occurrence and ..."

Victor Makarenkov et al. (2009)

> Home

Details and statistics

DOI: 10.1145/1656485.1656486

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/models/MakarenkovJMB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/models/MakarenkovJMB09
Victor Makarenkov, Pavel Jelnov, Azzam Maraee, Mira Balaban:
Finite satisfiability of class diagrams: practical occurrence and scalability of the FiniteSat algorithm. MoDeVVa@MoDELS 2009: 1:1-1:10

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.